Base | Representation |
---|---|
bin | 10000001001110111110… |
… | …101010100110110101001 |
3 | 10221010101121122010021212 |
4 | 100021313311110312221 |
5 | 121142002134430441 |
6 | 2205551201242505 |
7 | 143126416364633 |
oct | 20116765246651 |
9 | 3833347563255 |
10 | 1110112030121 |
11 | 398883333986 |
12 | 15b192333435 |
13 | 808b5a5bb53 |
14 | 3ba3046da53 |
15 | 1dd235dceeb |
hex | 10277d54da9 |
1110112030121 has 2 divisors, whose sum is σ = 1110112030122. Its totient is φ = 1110112030120.
The previous prime is 1110112030091. The next prime is 1110112030129. The reversal of 1110112030121 is 1210302110111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 967348964521 + 142763065600 = 983539^2 + 377840^2 .
It is a cyclic number.
It is not a de Polignac number, because 1110112030121 - 26 = 1110112030057 is a prime.
It is a super-2 number, since 2×11101120301212 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1110112030096 and 1110112030105.
It is not a weakly prime, because it can be changed into another prime (1110112030129) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555056015060 + 555056015061.
It is an arithmetic number, because the mean of its divisors is an integer number (555056015061).
Almost surely, 21110112030121 is an apocalyptic number.
It is an amenable number.
1110112030121 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110112030121 is an equidigital number, since it uses as much as digits as its factorization.
1110112030121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 1110112030121 its reverse (1210302110111), we get a palindrome (2320414140232).
The spelling of 1110112030121 in words is "one trillion, one hundred ten billion, one hundred twelve million, thirty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.135 sec. • engine limits •