Base | Representation |
---|---|
bin | 11110101101001101000… |
… | …101000101011111110001 |
3 | 21110201121001001020010121 |
4 | 132231031011011133301 |
5 | 234033012230334301 |
6 | 4253213212130241 |
7 | 305310536043013 |
oct | 36551505053761 |
9 | 7421531036117 |
10 | 2110122121201 |
11 | 743996a21406 |
12 | 2a0b57766981 |
13 | 123ca314b833 |
14 | 741b7d821b3 |
15 | 39d50b993a1 |
hex | 1eb4d1457f1 |
2110122121201 has 2 divisors, whose sum is σ = 2110122121202. Its totient is φ = 2110122121200.
The previous prime is 2110122121199. The next prime is 2110122121249. The reversal of 2110122121201 is 1021212210112.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1623649350625 + 486472770576 = 1274225^2 + 697476^2 .
It is a cyclic number.
It is not a de Polignac number, because 2110122121201 - 21 = 2110122121199 is a prime.
Together with 2110122121199, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (2110122121501) 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, 1055061060600 + 1055061060601.
It is an arithmetic number, because the mean of its divisors is an integer number (1055061060601).
Almost surely, 22110122121201 is an apocalyptic number.
It is an amenable number.
2110122121201 is a deficient number, since it is larger than the sum of its proper divisors (1).
2110122121201 is an equidigital number, since it uses as much as digits as its factorization.
2110122121201 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 16.
Adding to 2110122121201 its reverse (1021212210112), we get a palindrome (3131334331313).
The spelling of 2110122121201 in words is "two trillion, one hundred ten billion, one hundred twenty-two million, one hundred twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •