Base | Representation |
---|---|
bin | 11101000111100100111… |
… | …001001110111000000011 |
3 | 21002021221010112011111011 |
4 | 131013210321032320003 |
5 | 230241022000013102 |
6 | 4131125142301351 |
7 | 264365434241656 |
oct | 35074471167003 |
9 | 7067833464434 |
10 | 2001000001027 |
11 | 70168a375415 |
12 | 283982a27857 |
13 | 1169027a1b61 |
14 | 6cbc55db89d |
15 | 370b5bae2d7 |
hex | 1d1e4e4ee03 |
2001000001027 has 2 divisors, whose sum is σ = 2001000001028. Its totient is φ = 2001000001026.
The previous prime is 2001000000977. The next prime is 2001000001069. The reversal of 2001000001027 is 7201000001002.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2001000001027 - 215 = 2000999968259 is a prime.
It is a super-2 number, since 2×20010000010272 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2001000000998 and 2001000001016.
It is not a weakly prime, because it can be changed into another prime (2001000001927) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1000500000513 + 1000500000514.
It is an arithmetic number, because the mean of its divisors is an integer number (1000500000514).
Almost surely, 22001000001027 is an apocalyptic number.
2001000001027 is a deficient number, since it is larger than the sum of its proper divisors (1).
2001000001027 is an equidigital number, since it uses as much as digits as its factorization.
2001000001027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 28, while the sum is 13.
Adding to 2001000001027 its reverse (7201000001002), we get a palindrome (9202000002029).
The spelling of 2001000001027 in words is "two trillion, one billion, one thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •