Base | Representation |
---|---|
bin | 1001000110011011101000… |
… | …00100100111111011010101 |
3 | 2121212010222121220210010102 |
4 | 10203031310010213323111 |
5 | 10110334441200014422 |
6 | 110321251110303445 |
7 | 4133555654226413 |
oct | 443156404477325 |
9 | 77763877823112 |
10 | 20012200001237 |
11 | 6416143202594 |
12 | 22b25b9357b85 |
13 | b221b0a03292 |
14 | 4d284a65c2b3 |
15 | 24a86ae61192 |
hex | 123374127ed5 |
20012200001237 has 2 divisors, whose sum is σ = 20012200001238. Its totient is φ = 20012200001236.
The previous prime is 20012200001201. The next prime is 20012200001249. The reversal of 20012200001237 is 73210000221002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12883225241041 + 7128974760196 = 3589321^2 + 2670014^2 .
It is a cyclic number.
It is not a de Polignac number, because 20012200001237 - 216 = 20012199935701 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20012200007237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10006100000618 + 10006100000619.
It is an arithmetic number, because the mean of its divisors is an integer number (10006100000619).
Almost surely, 220012200001237 is an apocalyptic number.
It is an amenable number.
20012200001237 is a deficient number, since it is larger than the sum of its proper divisors (1).
20012200001237 is an equidigital number, since it uses as much as digits as its factorization.
20012200001237 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 336, while the sum is 20.
Adding to 20012200001237 its reverse (73210000221002), we get a palindrome (93222200222239).
The spelling of 20012200001237 in words is "twenty trillion, twelve billion, two hundred million, one thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •