Base | Representation |
---|---|
bin | 10000000001011111010… |
… | …001010011110111100111 |
3 | 10220021011020201200000121 |
4 | 100001133101103313213 |
5 | 121020033130014002 |
6 | 2201502024422411 |
7 | 142360350403303 |
oct | 20013721236747 |
9 | 3807136650017 |
10 | 1101110001127 |
11 | 394a839872a4 |
12 | 15949b617a07 |
13 | 7caaca4b186 |
14 | 3b418a8ad03 |
15 | 1d998160237 |
hex | 1005f453de7 |
1101110001127 has 2 divisors, whose sum is σ = 1101110001128. Its totient is φ = 1101110001126.
The previous prime is 1101110001097. The next prime is 1101110001133. The reversal of 1101110001127 is 7211000111011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1101110001127 - 227 = 1100975783399 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1101110001127.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1101110001227) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550555000563 + 550555000564.
It is an arithmetic number, because the mean of its divisors is an integer number (550555000564).
Almost surely, 21101110001127 is an apocalyptic number.
1101110001127 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101110001127 is an equidigital number, since it uses as much as digits as its factorization.
1101110001127 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 1101110001127 its reverse (7211000111011), we get a palindrome (8312110112138).
The spelling of 1101110001127 in words is "one trillion, one hundred one billion, one hundred ten million, one thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •