Base | Representation |
---|---|
bin | 1111000110010… |
… | …01100000000101 |
3 | 22211022201021021 |
4 | 13203021200011 |
5 | 224410420334 |
6 | 20322351141 |
7 | 3065355004 |
oct | 743114005 |
9 | 284281237 |
10 | 126654469 |
11 | 65547417 |
12 | 364bb4b1 |
13 | 20316a96 |
14 | 12b6cc3b |
15 | b1bc3b4 |
hex | 78c9805 |
126654469 has 2 divisors, whose sum is σ = 126654470. Its totient is φ = 126654468.
The previous prime is 126654467. The next prime is 126654481. The reversal of 126654469 is 964456621.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 75030244 + 51624225 = 8662^2 + 7185^2 .
It is an emirp because it is prime and its reverse (964456621) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 126654469 - 21 = 126654467 is a prime.
It is a super-2 number, since 2×1266544692 = 32082709035343922, which contains 22 as substring.
Together with 126654467, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (126654461) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 63327234 + 63327235.
It is an arithmetic number, because the mean of its divisors is an integer number (63327235).
Almost surely, 2126654469 is an apocalyptic number.
It is an amenable number.
126654469 is a deficient number, since it is larger than the sum of its proper divisors (1).
126654469 is an equidigital number, since it uses as much as digits as its factorization.
126654469 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 311040, while the sum is 43.
The square root of 126654469 is about 11254.0867688143. The cubic root of 126654469 is about 502.1962970990.
The spelling of 126654469 in words is "one hundred twenty-six million, six hundred fifty-four thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •