Base | Representation |
---|---|
bin | 10000001001110111101… |
… | …101111101111000100011 |
3 | 10221010101111000010001221 |
4 | 100021313231331320203 |
5 | 121142001141213102 |
6 | 2205551052035511 |
7 | 143126364111514 |
oct | 20116755757043 |
9 | 3833344003057 |
10 | 1110110101027 |
11 | 398882236594 |
12 | 15b191762b97 |
13 | 808b5534a85 |
14 | 3ba300caa0b |
15 | 1dd2335b637 |
hex | 10277b7de23 |
1110110101027 has 2 divisors, whose sum is σ = 1110110101028. Its totient is φ = 1110110101026.
The previous prime is 1110110101003. The next prime is 1110110101031. The reversal of 1110110101027 is 7201010110111.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1110110101027 - 231 = 1107962617379 is a prime.
It is a super-2 number, since 2×11101101010272 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1110110101027.
It is not a weakly prime, because it can be changed into another prime (1110110104027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555055050513 + 555055050514.
It is an arithmetic number, because the mean of its divisors is an integer number (555055050514).
Almost surely, 21110110101027 is an apocalyptic number.
1110110101027 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110110101027 is an equidigital number, since it uses as much as digits as its factorization.
1110110101027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14, while the sum is 16.
Adding to 1110110101027 its reverse (7201010110111), we get a palindrome (8311120211138).
The spelling of 1110110101027 in words is "one trillion, one hundred ten billion, one hundred ten million, one hundred one thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •