Base | Representation |
---|---|
bin | 10000001001110111110… |
… | …001011110110000101001 |
3 | 10221010101112201220120112 |
4 | 100021313301132300221 |
5 | 121142001410201441 |
6 | 2205551123504105 |
7 | 143126404666103 |
oct | 20116761366051 |
9 | 3833345656515 |
10 | 1110111022121 |
11 | 398882805622 |
12 | 15b191b28035 |
13 | 808b57980ba |
14 | 3ba3028a573 |
15 | 1dd2348e4eb |
hex | 10277c5ec29 |
1110111022121 has 2 divisors, whose sum is σ = 1110111022122. Its totient is φ = 1110111022120.
The previous prime is 1110111022061. The next prime is 1110111022123. The reversal of 1110111022121 is 1212201110111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1062525962521 + 47585059600 = 1030789^2 + 218140^2 .
It is a cyclic number.
It is not a de Polignac number, because 1110111022121 - 218 = 1110110759977 is a prime.
Together with 1110111022123, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 1110111022096 and 1110111022105.
It is not a weakly prime, because it can be changed into another prime (1110111022123) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555055511060 + 555055511061.
It is an arithmetic number, because the mean of its divisors is an integer number (555055511061).
Almost surely, 21110111022121 is an apocalyptic number.
It is an amenable number.
1110111022121 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110111022121 is an equidigital number, since it uses as much as digits as its factorization.
1110111022121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 1110111022121 its reverse (1212201110111), we get a palindrome (2322312132232).
The spelling of 1110111022121 in words is "one trillion, one hundred ten billion, one hundred eleven million, twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •