Base | Representation |
---|---|
bin | 1001000110000111000000… |
… | …10011111001110010110101 |
3 | 2121211002102012201111101001 |
4 | 10203003200103321302311 |
5 | 10110144304021402041 |
6 | 110312220500203301 |
7 | 4133014446522211 |
oct | 443034023716265 |
9 | 77732365644331 |
10 | 20001131044021 |
11 | 6411483056166 |
12 | 22b042a399531 |
13 | b2113871395a |
14 | 4d20ba55b941 |
15 | 24a41e300131 |
hex | 1230e04f9cb5 |
20001131044021 has 2 divisors, whose sum is σ = 20001131044022. Its totient is φ = 20001131044020.
The previous prime is 20001131043923. The next prime is 20001131044079. The reversal of 20001131044021 is 12044013110002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13444791557796 + 6556339486225 = 3666714^2 + 2560535^2 .
It is a cyclic number.
It is not a de Polignac number, because 20001131044021 - 213 = 20001131035829 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20001131044021.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20001131084021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10000565522010 + 10000565522011.
It is an arithmetic number, because the mean of its divisors is an integer number (10000565522011).
Almost surely, 220001131044021 is an apocalyptic number.
It is an amenable number.
20001131044021 is a deficient number, since it is larger than the sum of its proper divisors (1).
20001131044021 is an equidigital number, since it uses as much as digits as its factorization.
20001131044021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 20001131044021 its reverse (12044013110002), we get a palindrome (32045144154023).
The spelling of 20001131044021 in words is "twenty trillion, one billion, one hundred thirty-one million, forty-four thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •