Base | Representation |
---|---|
bin | 1001000110000111010110… |
… | …00111011111100010100001 |
3 | 2121211002212211212021212201 |
4 | 10203003223013133202201 |
5 | 10110200141424341004 |
6 | 110312250454053201 |
7 | 4133022110516251 |
oct | 443035307374241 |
9 | 77732784767781 |
10 | 20001312340129 |
11 | 641156642365a |
12 | 22b047b04a201 |
13 | b2116714c763 |
14 | 4d20d6671961 |
15 | 24a4301b26a4 |
hex | 1230eb1df8a1 |
20001312340129 has 2 divisors, whose sum is σ = 20001312340130. Its totient is φ = 20001312340128.
The previous prime is 20001312340007. The next prime is 20001312340199. The reversal of 20001312340129 is 92104321310002.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19187028090000 + 814284250129 = 4380300^2 + 902377^2 .
It is a cyclic number.
It is not a de Polignac number, because 20001312340129 - 213 = 20001312331937 is a prime.
It is a super-2 number, since 2×200013123401292 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20001312340097 and 20001312340106.
It is not a weakly prime, because it can be changed into another prime (20001312340199) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10000656170064 + 10000656170065.
It is an arithmetic number, because the mean of its divisors is an integer number (10000656170065).
Almost surely, 220001312340129 is an apocalyptic number.
It is an amenable number.
20001312340129 is a deficient number, since it is larger than the sum of its proper divisors (1).
20001312340129 is an equidigital number, since it uses as much as digits as its factorization.
20001312340129 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2592, while the sum is 28.
The spelling of 20001312340129 in words is "twenty trillion, one billion, three hundred twelve million, three hundred forty thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •