Base | Representation |
---|---|
bin | 10111000000110101000111… |
… | …111111010110110100100001 |
3 | 111021100210011010010010212201 |
4 | 113000311013333112310201 |
5 | 101231224401200333441 |
6 | 555132111420053201 |
7 | 30214222330156621 |
oct | 2700650777266441 |
9 | 437323133103781 |
10 | 101212112121121 |
11 | 2a2818a7775121 |
12 | b427703694201 |
13 | 4462351b91111 |
14 | 1adc999bc2881 |
15 | ba7b5c9c6c31 |
hex | 5c0d47fd6d21 |
101212112121121 has 2 divisors, whose sum is σ = 101212112121122. Its totient is φ = 101212112121120.
The previous prime is 101212112121073. The next prime is 101212112121137. The reversal of 101212112121121 is 121121211212101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 73565958243600 + 27646153877521 = 8577060^2 + 5257961^2 .
It is an emirp because it is prime and its reverse (121121211212101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101212112121121 - 27 = 101212112120993 is a prime.
It is not a weakly prime, because it can be changed into another prime (101212112121161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50606056060560 + 50606056060561.
It is an arithmetic number, because the mean of its divisors is an integer number (50606056060561).
Almost surely, 2101212112121121 is an apocalyptic number.
It is an amenable number.
101212112121121 is a deficient number, since it is larger than the sum of its proper divisors (1).
101212112121121 is an equidigital number, since it uses as much as digits as its factorization.
101212112121121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 19.
Adding to 101212112121121 its reverse (121121211212101), we get a palindrome (222333323333222).
The spelling of 101212112121121 in words is "one hundred one trillion, two hundred twelve billion, one hundred twelve million, one hundred twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •