Base | Representation |
---|---|
bin | 1001010010111000111000… |
… | …0101110111100010010101 |
3 | 1100012000220010002200012022 |
4 | 2110232032011313202111 |
5 | 2314421241420200203 |
6 | 33423015413502525 |
7 | 2103243611001131 |
oct | 224561605674225 |
9 | 40160803080168 |
10 | 10220111100053 |
11 | 3290363307368 |
12 | 1190886641a45 |
13 | 5919a1b812aa |
14 | 2749281763c1 |
15 | 12acadc7ba38 |
hex | 94b8e177895 |
10220111100053 has 2 divisors, whose sum is σ = 10220111100054. Its totient is φ = 10220111100052.
The previous prime is 10220111100019. The next prime is 10220111100149. The reversal of 10220111100053 is 35000111102201.
10220111100053 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6539154209329 + 3680956890724 = 2557177^2 + 1918582^2 .
It is a cyclic number.
It is not a de Polignac number, because 10220111100053 - 228 = 10219842664597 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10220111100013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5110055550026 + 5110055550027.
It is an arithmetic number, because the mean of its divisors is an integer number (5110055550027).
Almost surely, 210220111100053 is an apocalyptic number.
It is an amenable number.
10220111100053 is a deficient number, since it is larger than the sum of its proper divisors (1).
10220111100053 is an equidigital number, since it uses as much as digits as its factorization.
10220111100053 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 60, while the sum is 17.
Adding to 10220111100053 its reverse (35000111102201), we get a palindrome (45220222202254).
The spelling of 10220111100053 in words is "ten trillion, two hundred twenty billion, one hundred eleven million, one hundred thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •