Base | Representation |
---|---|
bin | 10010101000111011… |
… | …11110000100000111 |
3 | 221211102002012010012 |
4 | 21110131332010013 |
5 | 130443302432002 |
6 | 4332554220435 |
7 | 502661515655 |
oct | 112435760407 |
9 | 27742065105 |
10 | 10007077127 |
11 | 4275809183 |
12 | 1b3342471b |
13 | c362c7818 |
14 | 6ad085dd5 |
15 | 3d8809d52 |
hex | 25477e107 |
10007077127 has 2 divisors, whose sum is σ = 10007077128. Its totient is φ = 10007077126.
The previous prime is 10007077103. The next prime is 10007077151. The reversal of 10007077127 is 72177070001.
10007077127 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is a balanced prime because it is at equal distance from previous prime (10007077103) and next prime (10007077151).
It is an emirp because it is prime and its reverse (72177070001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10007077127 - 26 = 10007077063 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10007077093 and 10007077102.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10007077627) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5003538563 + 5003538564.
It is an arithmetic number, because the mean of its divisors is an integer number (5003538564).
Almost surely, 210007077127 is an apocalyptic number.
10007077127 is a deficient number, since it is larger than the sum of its proper divisors (1).
10007077127 is an equidigital number, since it uses as much as digits as its factorization.
10007077127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4802, while the sum is 32.
The spelling of 10007077127 in words is "ten billion, seven million, seventy-seven thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •