Base | Representation |
---|---|
bin | 10010101000101100… |
… | …000101111010110101 |
3 | 1220122112100022202002 |
4 | 102220230011322311 |
5 | 311440030000203 |
6 | 13105323425045 |
7 | 1305603123401 |
oct | 225054057265 |
9 | 56575308662 |
10 | 20010000053 |
11 | 853913a22a |
12 | 3a65385185 |
13 | 1b6b799524 |
14 | d7b76a101 |
15 | 7c1a93d88 |
hex | 4a8b05eb5 |
20010000053 has 2 divisors, whose sum is σ = 20010000054. Its totient is φ = 20010000052.
The previous prime is 20010000013. The next prime is 20010000061. The reversal of 20010000053 is 35000001002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14983473649 + 5026526404 = 122407^2 + 70898^2 .
It is a cyclic number.
It is not a de Polignac number, because 20010000053 - 220 = 20008951477 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 20009999989 and 20010000043.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20010000013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10005000026 + 10005000027.
It is an arithmetic number, because the mean of its divisors is an integer number (10005000027).
Almost surely, 220010000053 is an apocalyptic number.
It is an amenable number.
20010000053 is a deficient number, since it is larger than the sum of its proper divisors (1).
20010000053 is an equidigital number, since it uses as much as digits as its factorization.
20010000053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30, while the sum is 11.
Adding to 20010000053 its reverse (35000001002), we get a palindrome (55010001055).
The spelling of 20010000053 in words is "twenty billion, ten million, fifty-three", and thus it is an aban number and an uban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •