Base | Representation |
---|---|
bin | 10010101000001010… |
… | …001001100011110011 |
3 | 1220121220121021000001 |
4 | 102220022021203303 |
5 | 311430240231232 |
6 | 13104405010431 |
7 | 1305434363632 |
oct | 225012114363 |
9 | 56556537001 |
10 | 20001102067 |
11 | 8534112021 |
12 | 3a623b3a17 |
13 | 1b699a244b |
14 | d7a4d1519 |
15 | 7c0dd76e7 |
hex | 4a82898f3 |
20001102067 has 2 divisors, whose sum is σ = 20001102068. Its totient is φ = 20001102066.
The previous prime is 20001102031. The next prime is 20001102091. The reversal of 20001102067 is 76020110002.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 20001102067 - 211 = 20001100019 is a prime.
It is not a weakly prime, because it can be changed into another prime (20001102167) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10000551033 + 10000551034.
It is an arithmetic number, because the mean of its divisors is an integer number (10000551034).
Almost surely, 220001102067 is an apocalyptic number.
20001102067 is a deficient number, since it is larger than the sum of its proper divisors (1).
20001102067 is an equidigital number, since it uses as much as digits as its factorization.
20001102067 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 168, while the sum is 19.
Adding to 20001102067 its reverse (76020110002), we get a palindrome (96021212069).
The spelling of 20001102067 in words is "twenty billion, one million, one hundred two thousand, sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •