Base | Representation |
---|---|
bin | 1001000110000111010110… |
… | …00111011111100011100111 |
3 | 2121211002212211212021222022 |
4 | 10203003223013133203213 |
5 | 10110200141424341244 |
6 | 110312250454053355 |
7 | 4133022110516411 |
oct | 443035307374347 |
9 | 77732784767868 |
10 | 20001312340199 |
11 | 6411566423713 |
12 | 22b047b04a25b |
13 | b2116714c7b8 |
14 | 4d20d66719b1 |
15 | 24a4301b26ee |
hex | 1230eb1df8e7 |
20001312340199 has 2 divisors, whose sum is σ = 20001312340200. Its totient is φ = 20001312340198.
The previous prime is 20001312340129. The next prime is 20001312340231. The reversal of 20001312340199 is 99104321310002.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 20001312340199 - 232 = 19997017372903 is a prime.
It is a super-2 number, since 2×200013123401992 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20001312340129) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10000656170099 + 10000656170100.
It is an arithmetic number, because the mean of its divisors is an integer number (10000656170100).
Almost surely, 220001312340199 is an apocalyptic number.
20001312340199 is a deficient number, since it is larger than the sum of its proper divisors (1).
20001312340199 is an equidigital number, since it uses as much as digits as its factorization.
20001312340199 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11664, while the sum is 35.
The spelling of 20001312340199 in words is "twenty trillion, one billion, three hundred twelve million, three hundred forty thousand, one hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.195 sec. • engine limits •