Base | Representation |
---|---|
bin | 10000000001011110101… |
… | …111000000110011001111 |
3 | 10220021010121210212200121 |
4 | 100001132233000303033 |
5 | 121020023324311002 |
6 | 2201501104005411 |
7 | 142360211105416 |
oct | 20013657006317 |
9 | 3807117725617 |
10 | 1101101010127 |
11 | 394a798a6218 |
12 | 159498600867 |
13 | 7caaac20961 |
14 | 3b4177ca47d |
15 | 1d997486237 |
hex | 1005ebc0ccf |
1101101010127 has 2 divisors, whose sum is σ = 1101101010128. Its totient is φ = 1101101010126.
The previous prime is 1101101010109. The next prime is 1101101010137. The reversal of 1101101010127 is 7210101011011.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1101101010127 is a prime.
It is a super-2 number, since 2×11011010101272 (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 1101101010127.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1101101010137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550550505063 + 550550505064.
It is an arithmetic number, because the mean of its divisors is an integer number (550550505064).
Almost surely, 21101101010127 is an apocalyptic number.
1101101010127 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101101010127 is an equidigital number, since it uses as much as digits as its factorization.
1101101010127 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 1101101010127 its reverse (7210101011011), we get a palindrome (8311202021138).
The spelling of 1101101010127 in words is "one trillion, one hundred one billion, one hundred one million, ten thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •