Base | Representation |
---|---|
bin | 1001000110001000110110… |
… | …11001010000011100010101 |
3 | 2121211011222021221200101221 |
4 | 10203010123121100130111 |
5 | 10110203321302201003 |
6 | 110312503110250341 |
7 | 4133051144216626 |
oct | 443043331203425 |
9 | 77734867850357 |
10 | 20002122303253 |
11 | 6411941649972 |
12 | 22b06663569b1 |
13 | b21265bb048c |
14 | 4d2172071a4d |
15 | 24a47b3567bd |
hex | 12311b650715 |
20002122303253 has 2 divisors, whose sum is σ = 20002122303254. Its totient is φ = 20002122303252.
The previous prime is 20002122303187. The next prime is 20002122303287. The reversal of 20002122303253 is 35230322120002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19069134379684 + 932987923569 = 4366822^2 + 965913^2 .
It is a cyclic number.
It is not a de Polignac number, because 20002122303253 - 229 = 20001585432341 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20002122303953) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10001061151626 + 10001061151627.
It is an arithmetic number, because the mean of its divisors is an integer number (10001061151627).
Almost surely, 220002122303253 is an apocalyptic number.
It is an amenable number.
20002122303253 is a deficient number, since it is larger than the sum of its proper divisors (1).
20002122303253 is an equidigital number, since it uses as much as digits as its factorization.
20002122303253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4320, while the sum is 25.
Adding to 20002122303253 its reverse (35230322120002), we get a palindrome (55232444423255).
The spelling of 20002122303253 in words is "twenty trillion, two billion, one hundred twenty-two million, three hundred three thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •