Base | Representation |
---|---|
bin | 1001000110000111001001… |
… | …00010110110001001111101 |
3 | 2121211002121011100222220002 |
4 | 10203003210202312021331 |
5 | 10110144430212221031 |
6 | 110312231514404045 |
7 | 4133016301321355 |
oct | 443034442661175 |
9 | 77732534328802 |
10 | 20001202070141 |
11 | 641150a158136 |
12 | 22b044a130625 |
13 | b2114a351546 |
14 | 4d20c5b69b65 |
15 | 24a42567eccb |
hex | 1230e48b627d |
20001202070141 has 2 divisors, whose sum is σ = 20001202070142. Its totient is φ = 20001202070140.
The previous prime is 20001202070099. The next prime is 20001202070303. The reversal of 20001202070141 is 14107020210002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 16503662500900 + 3497539569241 = 4062470^2 + 1870171^2 .
It is a cyclic number.
It is not a de Polignac number, because 20001202070141 - 226 = 20001134961277 is a prime.
It is a super-2 number, since 2×200012020701412 (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 (20001202070341) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10000601035070 + 10000601035071.
It is an arithmetic number, because the mean of its divisors is an integer number (10000601035071).
Almost surely, 220001202070141 is an apocalyptic number.
It is an amenable number.
20001202070141 is a deficient number, since it is larger than the sum of its proper divisors (1).
20001202070141 is an equidigital number, since it uses as much as digits as its factorization.
20001202070141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 224, while the sum is 20.
Adding to 20001202070141 its reverse (14107020210002), we get a palindrome (34108222280143).
The spelling of 20001202070141 in words is "twenty trillion, one billion, two hundred two million, seventy thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •