"Telephone numbers in Guatemala Country Code: +502<br>International Call Prefix: 00<br> In Guatemala, regular phone numbers are 8 digits. The first digit indicates the type of phone:2: Guatemala City (Geographic Number)3: Mobile (non geographic)4: Mobile (non geographic)5: Mobile (non geographic)6: Guatemala Department (Geographic Number)7: Rural Guatemala / Rest of country (Geographic Number) Within each area, there are different service providers. The following 3 digits indicate the service provider. However, their assignment is on a first-come first-served basis. Additionally, the same service provider has different numbers in each of the 5 telephone types, and those numbers are not contiguous. The assignment tables"
"assumed. The single-digit final state reached in the process of calculating an integer's additive persistence is its digital root. Put another way, a number's additive persistence counts how many times we must sum its digits to arrive at its digital root. The additive persistence of 2718 is 2: first we find that 2 + 7 + 1 + 8 = 18, and then that 1 + 8 = 9. The multiplicative persistence of 39 is 3, because it takes three steps to reduce 39 to a single digit: 39 → 27 → 14 → 4. Also, 39 is the smallest"
"41 + 43 + 47), Motzkin number, self number. A Lucas and Fibonacci pseudoprime. ""See 323 (disambiguation)"" 324 = 2 × 3 = 18. 324 is the sum of four consecutive primes (73 + 79 + 83 + 89), totient sum of the first 32 integers, untouchable number, and a Harshad number. 325 = 5 × 13. 325 is a triangular number, hexagonal number, nonagonal number, centered nonagonal number. 325 is the smallest number to be the sum of two squares in 3 different ways: 1 + 18, 6 + 17 and 10 + 15. 325 is also the smallest"
"25 (number) 25 (twenty-five) is the natural number following 24 and preceding 26. It is a square number, being 5 = 5 × 5. It is one of two two-digit numbers whose square and higher powers of the number also ends in the same last two digits, e.g. 25 = 625, the other is 76. It is the smallest square that is also a sum of two (non-zero) squares: 25 = 3 + 4. Hence it often appears in illustrations of the Pythagorean theorem. 25 is the sum of the single-digit odd natural numbers 1, 3, 5, 7 and 9,"
"are 277 squares that a knight can reach from a given starting position in exactly six moves. 277 appears as the numerator of the fifth term of the Taylor series for the secant function: Since no number added to the sum of its digits generates 277, it is a self number. The next prime self number is not reached until 367. 277 (number) 277 (two hundred [and] seventy-seven) is the natural number following 276 and preceding 278. 277 is the 59th prime number, and is a regular prime. It is the smallest prime ""p"" such that the sum of the"
"271 (number) 271 (two hundred [and] seventy-one) is the natural number after and before . 271 is a twin prime with 269, a cuban prime (a prime number that is the difference of two consecutive cubes), and a centered hexagonal number. It is the smallest prime number bracketed on both sides by numbers divisible by cubes, and the smallest prime number bracketed by numbers with five primes (counting repetitions) in their factorizations: After 7, 271 is the second-smallest Eisenstein–Mersenne prime, one of the analogues of the Mersenne primes in the Eisenstein integers. 271 is the largest prime factor of the"
"consecutive powers of 2 (8 + 16 + 32 + 64), and four consecutive powers of 3 (3 + 9 + 27 + 81). It is highly composite, superabundant, and colossally abundant number, with its 16 divisors being more than any number lower than it has, and it is also the smallest number to have exactly that many divisors. It is also a sparsely totient number. 120 is the smallest number to appear six times in Pascal's triangle. 120 is also the smallest multiple of 6 with no adjacent prime number, being adjacent to 119 = 7 × 17 and"
"the first 29 natural numbers have more than two different prime factors. This is the longest such consecutive sequence. 29 is a Markov number, appearing in the solutions to ""x"" + ""y"" + ""z"" = 3""xyz"": {2, 5, 29}, {2, 29, 169}, {5, 29, 433}, {29, 169, 14701}, etc. 29 is a Perrin number, preceded in the sequence by 12, 17, 22. 29 is the smallest positive whole number that cannot be made from the numbers {1, 2, 3, 4}, using each exactly once and using only addition, subtraction, multiplication, and division. 29 (number) 29 (twenty-nine) is the natural number"
"totient numbers are For example, start with 327. Then φ(327) = 216, φ(216) = 72, φ(72) = 24, φ(24) = 8, φ(8) = 4, φ(4) = 2, φ(2) = 1, and 216 + 72 + 24 + 8 + 4 + 2 + 1 = 327. It can be observed that many perfect totient are multiples of 3; in fact, 4375 is the smallest perfect totient number that is not divisible by 3. All powers of 3 are perfect totient numbers, as may be seen by induction using the fact that Venkataraman (1975) found another family of perfect totient numbers:"
"1 to 6: there is no smaller number divisible by the numbers 1 to 5. It is the smallest number with exactly 12 divisors. It is one of seven integers that have more divisors than any number less than twice itself , one of six that are also lowest common multiple of a consecutive set of integers from 1, and one of six that are divisors of every highly composite number higher than itself. It is the sum of a pair of twin primes (29 + 31) and the sum of four consecutive primes (11 + 13 + 17 +"
"in ""Star Trek"", the total number of Rules of Acquisition, repdigit in base 7 (555). 286 = 2·11·13, sphenic number, tetrahedral number, nontotient, also shorthand for the Intel 80286 microprocessor chip. 286 is the smallest even pseudoprime (not divisible by 3) to base 3, which implies 3 ≡ 1 (mod 286). 287 = 7·41, sum of three consecutive primes (89 + 97 + 101), sum of five consecutive primes (47 + 53 + 59 + 61 + 67), sum of nine consecutive primes (17 + 19 + 23 + 29 + 31 + 37 + 41 + 43 + 47),"
"277 (number) 277 (two hundred [and] seventy-seven) is the natural number following 276 and preceding 278. 277 is the 59th prime number, and is a regular prime. It is the smallest prime ""p"" such that the sum of the inverses of the primes up to ""p"" is greater than two. Since 59 is itself prime, 277 is a super-prime. 59 is also a super-prime (it is the 17th prime), as is 17 (the 7th prime). However, 7 is the fourth prime number, and 4 is not prime. Thus, 277 is a super-super-super-prime but not a super-super-super-super-prime. It is the largest"
"77 (number) 77 (seventy-seven) is the natural number following 76 and preceding 78. Seventy-seven is the smallest positive integer requiring five syllables in English. 77 is: It is possible for a sudoku puzzle to have as many as 77 givens, yet lack a unique solution. It and its ""sibling"" 49 are the only 2-digit numbers whose home primes (in base 10) have not been calculated. During World War II in Sweden at the border with Norway, ""77"" was used as a shibboleth (password), because the tricky pronunciation in Swedish made it easy to instantly discern whether the speaker was native"
"Katydid sequence The Katydid sequence is a sequence of numbers first defined in Clifford A. Pickover's book ""Wonders of Numbers"" (2001). It is the smallest sequence of integers that can be reached from 1 by a sequence of the two operations ""n"" ↦ 2""n"" + 2 and 7""n"" + 7 (in any order). For instance, applying the first operation to 1 produces the number 4, and applying the second operation to 4 produces the number 35, both of which are in the sequence. The first 10 elements of the sequence are: Pickover asked whether there exist numbers that can be"
"five-digit repunit 11111, and the largest prime number for which the decimal period of its multiplicative inverse is 5: 271 (number) 271 (two hundred [and] seventy-one) is the natural number after and before . 271 is a twin prime with 269, a cuban prime (a prime number that is the difference of two consecutive cubes), and a centered hexagonal number. It is the smallest prime number bracketed on both sides by numbers divisible by cubes, and the smallest prime number bracketed by numbers with five primes (counting repetitions) in their factorizations: After 7, 271 is the second-smallest Eisenstein–Mersenne prime, one"
"(mod 8), (mod 12), (mod 5) and (mod 28), then by the law of quadratic reciprocity 2, 3, 5, and 7 will all be residues modulo ""p"", and thus all numbers 1–10 will be. The CRT says that this is the same as ""p"" ≡ 1 (mod 840), and Dirichlet's theorem says there are an infinite number of primes of this form. 2521 is the smallest, and indeed 1 ≡ 1, 1046 ≡ 2, 123 ≡ 3, 2 ≡ 4, 643 ≡ 5, 87 ≡ 6, 668 ≡ 7, 429 ≡ 8, 3 ≡ 9, and 529 ≡ 10 (mod"
"period 10; 451 is the smallest number with this period reciprocal length. 452 = 2 × 113 453 = 3 × 151 454 = 2 × 227, nontotient, a Smith number 455 = 5 × 7 × 13, sphenic number, tetrahedral number 456 = 2 × 3 × 19, sum of a twin prime (227 + 229), sum of four consecutive primes (107 + 109 + 113 + 127), centered pentagonal number 458 = 2 × 229, nontotient 459 = 3 × 17 460 = 2 × 5 × 23, centered triangular number, dodecagonal number, Harshad number, sum of twelve"
"59 + 61 + 67 + 71), as a sum of seven consecutive primes (31 + 37 + 41 + 43 + 47 + 53 + 59), and as a sum of eleven consecutive primes (11 + 13 + 17 + 19 + 23 + 29 + 31 + 37 + 41 + 43 + 47). 311 is a strictly non-palindromic number, as it is not palindromic in any base between base 2 and base 309. 311 is the smallest positive integer ""d"" such that the imaginary quadratic field Q() has class number = 19. 311 (number) 311 (three hundred"
"(and only known) 3-hyperperfect number. 326 = 2 × 163. 326 is a nontotient, noncototient, and an untouchable number. 326 is the sum of the 14 consecutive primes (3 + 5 + 7 + 11 + 13 + 17 + 19 + 23 + 29 + 31 + 37 + 41 + 43 + 47). 327 = 3 × 109. 327 is a perfect totient number. 328 = 2 × 41. 328 is a refactorable number, and it is the sum of the first fifteen primes (2 + 3 + 5 + 7 + 11 + 13 + 17 +"
"end up at either a sociable number or at a prime (and hence 1), or, equivalently, whether there exist numbers whose aliquot sequence never terminates, and hence grows without bound. An example with period 4: The following categorizes all known sociable numbers as of July 2018 by the length of the corresponding aliquot sequence: It is conjectured that if ""n"" = 3 mod 4, then there are no such sequence with length ""n"". The smallest number of the only known 28-cycle is 14316. The aliquot sequence can be represented as a directed graph, formula_10, for a given integer formula_11, where"
"sequence has been found. For instance, starting with ""n"" = 12, one gets the sequence 12, 6, 3, 10, 5, 16, 8, 4, 2, 1. ""n"" = 19, for example, takes longer to reach 1: 19, 58, 29, 88, 44, 22, 11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1. The sequence for ""n"" = 27, listed and graphed below, takes 111 steps (41 steps through odd numbers, in large font), climbing to 9232 before descending to 1. Numbers with a total stopping time longer than that of any smaller starting value form a"
"larger prime, implying that there are at least five numbers in the tuple. The shortest inadmissible tuple with more than one solution is the 5-tuple (0, 2, 8, 14, 26), which has two solutions: (3, 5, 11, 17, 29) and (5, 7, 13, 19, 31) where all congruences (mod 5) are included in both cases. The ""diameter"" of a ""k""-tuple is the difference of its largest and smallest elements. An admissible prime ""k""-tuple with the smallest possible diameter ""d"" (among all admissible ""k""-tuples) is a ""prime constellation"". For all ""n"" ≥ ""k"" this will always produce consecutive primes. This means"
"3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 47, 3, 1, 5, 3, ... . proved that this sequence contains only ones and prime numbers. However, it does not contain all the prime numbers, since the terms gcd(""n""+1, ""a"") are always odd and so never equal to 2. 587 is the smallest prime not appearing in the first 10,000 outcomes that are different from 1. Nevertheless, in the same paper it was conjectured to contain all (odd) primes, even though it is rather inefficient. Note"
"32 (number) 32 (thirty-two) is the natural number following 31 and preceding 33. 32 is the smallest number ""n"" with exactly 7 solutions to the equation φ(""x"") = ""n"". It is also the sum of the totient function for the first ten integers. The fifth power of two, 32 is also a Leyland number since 2 + 4 = 32. 32 is the ninth happy number. 32 = 1 + 2 + 3 In the Kabbalah, there are 32 Kabbalistic Paths of Wisdom. One of the central texts of the Pāli Canon in the Theravada Buddhist tradition, the Digha Nikaya,"
"the first five odd natural numbers. 25 is a centered octagonal number, a centered square number, and an automorphic number. 25 percent (%) is equal to . It is the smallest base 10 Friedman number as it can be expressed by its own digits: 5. It is also a Cullen number. 25 is the smallest pseudoprime satisfying the congruence 7 = 7 mod ""n"". 25 is the smallest aspiring number — a composite non-sociable number whose aliquot sequence does not terminate. According to the Shapiro inequality, 25 is the least odd integer ""n"" such that there exist ""x"", ""x"", …,"
"simple way as a subquotient. Twenty-six is a repdigit in base three (222) and in base twelve (22). In base ten, 26 is the smallest number that is not a palindrome to have a square (26 = 676) that is a palindrome. Twenty-six is: 26 (number) 26 (twenty-six) is the natural number following 25 and preceding 27. 26 is the only integer that is one greater than a square (5 + 1) and one less than a cube (3 − 1). A rhombicuboctahedron has twenty-six faces. When a 3 × 3 × 3 cube is made of twenty-seven unit cubes,"
"888 (number) 888 (eight hundred [and] eighty-eight) is the natural number following 887 and preceding 889. 888 is a repdigit (a number all of whose digits are equal), and a strobogrammatic number (one that reads the same upside-down on a seven-segment calculator display). 888 = 700227072 is the smallest cube in which each digit occurs exactly three times, and the only cube in which three distinct digits each occur three times. 888 the smallest multiple of 24 whose digit sum is 24, and as well as being divisible by its digit sum it is divisible by all of its digits."
"material. Thirty-two could also refer to: 32 (number) 32 (thirty-two) is the natural number following 31 and preceding 33. 32 is the smallest number ""n"" with exactly 7 solutions to the equation φ(""x"") = ""n"". It is also the sum of the totient function for the first ten integers. The fifth power of two, 32 is also a Leyland number since 2 + 4 = 32. 32 is the ninth happy number. 32 = 1 + 2 + 3 In the Kabbalah, there are 32 Kabbalistic Paths of Wisdom. One of the central texts of the Pāli Canon in the"
"five minus the fifth harmonic number. Every solvable configuration of the Fifteen puzzle can be solved in no more than 43 multi-tile moves (i.e. when moving two or three tiles at once is counted as one move). In auto racing: Forty-three is: 43 (number) 43 (forty-three) is the natural number following 42 and preceding 44. Forty-three is the 14th smallest prime number. The previous is forty-one, with which it comprises a twin prime, and the next is forty-seven. 43 is the smallest prime that is not a Chen prime. It is also the third Wagstaff prime. 43 is the fourth"
"220 (number) 220 (two hundred [and] twenty) is the natural number following 219 and preceding 221. It is a composite number, with its divisors being 1, 2, 4, 5, 10, 11, 20, 22, 44, 55 and 110, making it an amicable number with 284. Every number up to 220 may be expressed as a sum of its divisors, making 220 a practical number. Also, being divisible by the sum of its digits, 220 is a Harshad number. It is the sum of four consecutive primes (47 + 53 + 59 + 61). It is the smallest even number with the"
"abundant numbers, 18 and 20, are also not in formula_1. However, the fourth abundant number, 24, is in formula_1 because the sum of its proper divisors in formula_1 is: In other words, 24 is abundant but not formula_1-abundant because 12 is not in formula_1. In fact, 24 is formula_1-perfect - it is the smallest number that is formula_1-perfect but not perfect. The smallest odd abundant number that is in formula_1 is 2835, and the smallest pair of consecutive numbers that are not in formula_1 are 5984 and 5985. Granville number In mathematics, specifically number theory, Granville numbers are an extension"
"""x"" such that where ""x"" = ""x"", ""x"" = ""x"". Within base 10 one can readily test for divisibility by 25 by seeing if the last two digits of the number match 00, 25, 50 or 75. Twenty five is: 25 (number) 25 (twenty-five) is the natural number following 24 and preceding 26. It is a square number, being 5 = 5 × 5. It is one of two two-digit numbers whose square and higher powers of the number also ends in the same last two digits, e.g. 25 = 625, the other is 76. It is the smallest square"
"Sierpiński and Selfridge conjectured that 78,557 is the smallest Sierpiński number, and thus the answer to the Sierpiński problem. To show that 78,557 really is the smallest Sierpiński number, one must show that all the odd numbers smaller than 78,557 are ""not"" Sierpiński numbers. That is, for every odd ""k"" below 78,557 there exists a positive integer ""n"" such that ""k""2+1 is prime. , there are only five candidates: which have not been eliminated as possible Sierpiński numbers. In 1976, Nathan Mendelsohn determined that the second provable Sierpiński number is the prime ""k = 271129"". The prime Sierpiński problem asks"