Base | Representation |
---|---|
bin | 1001001011111101100110… |
… | …1011010011100101110001 |
3 | 1022202122202102120122111111 |
4 | 2102333121223103211301 |
5 | 2310444043222334301 |
6 | 33252220204113321 |
7 | 2061532113241264 |
oct | 222773153234561 |
9 | 38678672518444 |
10 | 10101120121201 |
11 | 3244951a7781a |
12 | 11717b8835841 |
13 | 5836baa42275 |
14 | 26cc7ac48cdb |
15 | 127b4768a551 |
hex | 92fd9ad3971 |
10101120121201 has 2 divisors, whose sum is σ = 10101120121202. Its totient is φ = 10101120121200.
The previous prime is 10101120121187. The next prime is 10101120121207. The reversal of 10101120121201 is 10212102110101.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10045102698801 + 56017422400 = 3169401^2 + 236680^2 .
It is an emirp because it is prime and its reverse (10212102110101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10101120121201 - 237 = 9963681167729 is a prime.
It is not a weakly prime, because it can be changed into another prime (10101120121207) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5050560060600 + 5050560060601.
It is an arithmetic number, because the mean of its divisors is an integer number (5050560060601).
Almost surely, 210101120121201 is an apocalyptic number.
It is an amenable number.
10101120121201 is a deficient number, since it is larger than the sum of its proper divisors (1).
10101120121201 is an equidigital number, since it uses as much as digits as its factorization.
10101120121201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 10101120121201 its reverse (10212102110101), we get a palindrome (20313222231302).
The spelling of 10101120121201 in words is "ten trillion, one hundred one billion, one hundred twenty million, one hundred twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •