Base | Representation |
---|---|
bin | 11101011001011111110… |
… | …10101010000000011111 |
3 | 10120120022002021200100202 |
4 | 32230233322222000133 |
5 | 113022212013021002 |
6 | 2052013203214115 |
7 | 132656513463305 |
oct | 16545772520037 |
9 | 3516262250322 |
10 | 1010121220127 |
11 | 35a432105428 |
12 | 14392767733b |
13 | 7433c1193a6 |
14 | 36c66722275 |
15 | 1b4200bb502 |
hex | eb2feaa01f |
1010121220127 has 2 divisors, whose sum is σ = 1010121220128. Its totient is φ = 1010121220126.
The previous prime is 1010121220109. The next prime is 1010121220139. The reversal of 1010121220127 is 7210221210101.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1010121220127 - 210 = 1010121219103 is a prime.
It is a super-2 number, since 2×10101212201272 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1010121220099 and 1010121220108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1010121220327) 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, 505060610063 + 505060610064.
It is an arithmetic number, because the mean of its divisors is an integer number (505060610064).
Almost surely, 21010121220127 is an apocalyptic number.
1010121220127 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010121220127 is an equidigital number, since it uses as much as digits as its factorization.
1010121220127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 112, while the sum is 20.
Adding to 1010121220127 its reverse (7210221210101), we get a palindrome (8220342430228).
The spelling of 1010121220127 in words is "one trillion, ten billion, one hundred twenty-one million, two hundred twenty thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •