Base | Representation |
---|---|
bin | 10010101110000100… |
… | …001101110111001111 |
3 | 1220212211002110200221 |
4 | 102232010031313033 |
5 | 312131123211002 |
6 | 13122305132211 |
7 | 1311046652464 |
oct | 225604156717 |
9 | 56784073627 |
10 | 20100210127 |
11 | 8585054408 |
12 | 3a8b62a067 |
13 | 1b84392c7a |
14 | d8972d66b |
15 | 7c9962c37 |
hex | 4ae10ddcf |
20100210127 has 2 divisors, whose sum is σ = 20100210128. Its totient is φ = 20100210126.
The previous prime is 20100210103. The next prime is 20100210131. The reversal of 20100210127 is 72101200102.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20100210127 is a prime.
It is a super-2 number, since 2×201002101272 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 20100210127.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20100216127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10050105063 + 10050105064.
It is an arithmetic number, because the mean of its divisors is an integer number (10050105064).
Almost surely, 220100210127 is an apocalyptic number.
20100210127 is a deficient number, since it is larger than the sum of its proper divisors (1).
20100210127 is an equidigital number, since it uses as much as digits as its factorization.
20100210127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56, while the sum is 16.
Adding to 20100210127 its reverse (72101200102), we get a palindrome (92201410229).
The spelling of 20100210127 in words is "twenty billion, one hundred million, two hundred ten thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •