Base | Representation |
---|---|
bin | 1001000110000111001000… |
… | …11111100100001010110101 |
3 | 2121211002121002202022001101 |
4 | 10203003210133210022311 |
5 | 10110144430002210122 |
6 | 110312231444130101 |
7 | 4133016261106645 |
oct | 443034437441265 |
9 | 77732532668041 |
10 | 20001201210037 |
11 | 641150971aa03 |
12 | 22b0449996931 |
13 | b2114a10cbc8 |
14 | 4d20c59c4525 |
15 | 24a425560027 |
hex | 1230e47e42b5 |
20001201210037 has 2 divisors, whose sum is σ = 20001201210038. Its totient is φ = 20001201210036.
The previous prime is 20001201209959. The next prime is 20001201210097. The reversal of 20001201210037 is 73001210210002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19976975532721 + 24225677316 = 4469561^2 + 155646^2 .
It is a cyclic number.
It is not a de Polignac number, because 20001201210037 - 27 = 20001201209909 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20001201209996 and 20001201210023.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20001201210097) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10000600605018 + 10000600605019.
It is an arithmetic number, because the mean of its divisors is an integer number (10000600605019).
Almost surely, 220001201210037 is an apocalyptic number.
It is an amenable number.
20001201210037 is a deficient number, since it is larger than the sum of its proper divisors (1).
20001201210037 is an equidigital number, since it uses as much as digits as its factorization.
20001201210037 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 20001201210037 its reverse (73001210210002), we get a palindrome (93002411420039).
The spelling of 20001201210037 in words is "twenty trillion, one billion, two hundred one million, two hundred ten thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •