Base | Representation |
---|---|
bin | 10010101000001001… |
… | …110011010100110111 |
3 | 1220121220102122002011 |
4 | 102220021303110313 |
5 | 311430224322444 |
6 | 13104403025051 |
7 | 1305433534264 |
oct | 225011632467 |
9 | 56556378064 |
10 | 20001010999 |
11 | 853405a662 |
12 | 3a6236b187 |
13 | 1b6996cb68 |
14 | d7a4aa26b |
15 | 7c0dba734 |
hex | 4a8273537 |
20001010999 has 2 divisors, whose sum is σ = 20001011000. Its totient is φ = 20001010998.
The previous prime is 20001010951. The next prime is 20001011021. The reversal of 20001010999 is 99901010002.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 20001010999 - 27 = 20001010871 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20001010999.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20001010399) 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, 10000505499 + 10000505500.
It is an arithmetic number, because the mean of its divisors is an integer number (10000505500).
Almost surely, 220001010999 is an apocalyptic number.
20001010999 is a deficient number, since it is larger than the sum of its proper divisors (1).
20001010999 is an equidigital number, since it uses as much as digits as its factorization.
20001010999 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1458, while the sum is 31.
The spelling of 20001010999 in words is "twenty billion, one million, ten thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •