Base | Representation |
---|---|
bin | 11101000110101011101… |
… | …10010111000111001111 |
3 | 10112121020010110012120021 |
4 | 32203111312113013033 |
5 | 112341020133211002 |
6 | 2043223011403011 |
7 | 132151301351461 |
oct | 16432566270717 |
9 | 3477203405507 |
10 | 1000020210127 |
11 | 35611937a084 |
12 | 1419888b3467 |
13 | 733bc5237b3 |
14 | 36588dc8131 |
15 | 1b02d409737 |
hex | e8d5d971cf |
1000020210127 has 2 divisors, whose sum is σ = 1000020210128. Its totient is φ = 1000020210126.
The previous prime is 1000020210121. The next prime is 1000020210143. The reversal of 1000020210127 is 7210120200001.
It is an a-pointer prime, because the next prime (1000020210143) can be obtained adding 1000020210127 to its sum of digits (16).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1000020210127 - 27 = 1000020209999 is a prime.
It is a super-2 number, since 2×10000202101272 (a number of 25 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 1000020210127.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1000020210121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500010105063 + 500010105064.
It is an arithmetic number, because the mean of its divisors is an integer number (500010105064).
Almost surely, 21000020210127 is an apocalyptic number.
1000020210127 is a deficient number, since it is larger than the sum of its proper divisors (1).
1000020210127 is an equidigital number, since it uses as much as digits as its factorization.
1000020210127 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 56, while the sum is 16.
Adding to 1000020210127 its reverse (7210120200001), we get a palindrome (8210140410128).
The spelling of 1000020210127 in words is "one trillion, twenty million, two hundred ten thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •