Base | Representation |
---|---|
bin | 1001001011111101111010… |
… | …0000010010111101100111 |
3 | 1022202122222001222212111202 |
4 | 2102333132200102331213 |
5 | 2310444224441334002 |
6 | 33252232220153115 |
7 | 2061534115600544 |
oct | 222773640227547 |
9 | 38678861885452 |
10 | 10101201121127 |
11 | 3244993771206 |
12 | 117181b99879b |
13 | 58370176280c |
14 | 26cc878d1bcb |
15 | 127b4e83a502 |
hex | 92fde812f67 |
10101201121127 has 2 divisors, whose sum is σ = 10101201121128. Its totient is φ = 10101201121126.
The previous prime is 10101201121093. The next prime is 10101201121139. The reversal of 10101201121127 is 72112110210101.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10101201121127 - 210 = 10101201120103 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10101201121099 and 10101201121108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10101201123127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5050600560563 + 5050600560564.
It is an arithmetic number, because the mean of its divisors is an integer number (5050600560564).
Almost surely, 210101201121127 is an apocalyptic number.
10101201121127 is a deficient number, since it is larger than the sum of its proper divisors (1).
10101201121127 is an equidigital number, since it uses as much as digits as its factorization.
10101201121127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56, while the sum is 20.
Adding to 10101201121127 its reverse (72112110210101), we get a palindrome (82213311331228).
The spelling of 10101201121127 in words is "ten trillion, one hundred one billion, two hundred one million, one hundred twenty-one thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •