Base | Representation |
---|---|
bin | 10000010100001101111… |
… | …011010101010111110101 |
3 | 10222012001202110122211221 |
4 | 100110031323111113311 |
5 | 121332224322401401 |
6 | 2215025330230341 |
7 | 144001610534512 |
oct | 20241573252765 |
9 | 3865052418757 |
10 | 1121220122101 |
11 | 3a256358a892 |
12 | 1613724253b1 |
13 | 819661a1241 |
14 | 3c3a583a309 |
15 | 1e2738ce7a1 |
hex | 1050ded55f5 |
1121220122101 has 2 divisors, whose sum is σ = 1121220122102. Its totient is φ = 1121220122100.
The previous prime is 1121220122069. The next prime is 1121220122117. The reversal of 1121220122101 is 1012210221211.
It is an a-pointer prime, because the next prime (1121220122117) can be obtained adding 1121220122101 to its sum of digits (16).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1102235415876 + 18984706225 = 1049874^2 + 137785^2 .
It is a cyclic number.
It is not a de Polignac number, because 1121220122101 - 25 = 1121220122069 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1121220122131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 560610061050 + 560610061051.
It is an arithmetic number, because the mean of its divisors is an integer number (560610061051).
Almost surely, 21121220122101 is an apocalyptic number.
It is an amenable number.
1121220122101 is a deficient number, since it is larger than the sum of its proper divisors (1).
1121220122101 is an equidigital number, since it uses as much as digits as its factorization.
1121220122101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 1121220122101 its reverse (1012210221211), we get a palindrome (2133430343312).
The spelling of 1121220122101 in words is "one trillion, one hundred twenty-one billion, two hundred twenty million, one hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •