Base | Representation |
---|---|
bin | 1001000110101100000001… |
… | …01101101000001000000001 |
3 | 2121212222201001110012210002 |
4 | 10203112000231220020001 |
5 | 10111011003003324022 |
6 | 110325304340045345 |
7 | 4134320044124021 |
oct | 443260055501001 |
9 | 77788631405702 |
10 | 20021002011137 |
11 | 641994a763936 |
12 | 22b4255093855 |
13 | b22c8445106a |
14 | 4d3043655a81 |
15 | 24abd3a7e092 |
hex | 123580b68201 |
20021002011137 has 2 divisors, whose sum is σ = 20021002011138. Its totient is φ = 20021002011136.
The previous prime is 20021002011079. The next prime is 20021002011163. The reversal of 20021002011137 is 73111020012002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17994937297936 + 2026064713201 = 4242044^2 + 1423399^2 .
It is a cyclic number.
It is not a de Polignac number, because 20021002011137 - 216 = 20021001945601 is a prime.
It is not a weakly prime, because it can be changed into another prime (20021002211137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10010501005568 + 10010501005569.
It is an arithmetic number, because the mean of its divisors is an integer number (10010501005569).
Almost surely, 220021002011137 is an apocalyptic number.
It is an amenable number.
20021002011137 is a deficient number, since it is larger than the sum of its proper divisors (1).
20021002011137 is an equidigital number, since it uses as much as digits as its factorization.
20021002011137 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 20.
Adding to 20021002011137 its reverse (73111020012002), we get a palindrome (93132022023139).
The spelling of 20021002011137 in words is "twenty trillion, twenty-one billion, two million, eleven thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •