Base | Representation |
---|---|
bin | 11110101110111101001… |
… | …000010010111111110001 |
3 | 21110220110001101112022012 |
4 | 132232331020102333301 |
5 | 234100340003323441 |
6 | 4254123524452305 |
7 | 305405243614442 |
oct | 36567510227761 |
9 | 7426401345265 |
10 | 2112002011121 |
11 | 744771091542 |
12 | 2a13a124a095 |
13 | 124212760b32 |
14 | 743158d32c9 |
15 | 39e10c339eb |
hex | 1ebbd212ff1 |
2112002011121 has 2 divisors, whose sum is σ = 2112002011122. Its totient is φ = 2112002011120.
The previous prime is 2112002011109. The next prime is 2112002011181. The reversal of 2112002011121 is 1211102002112.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2074176040000 + 37825971121 = 1440200^2 + 194489^2 .
It is a cyclic number.
It is not a de Polignac number, because 2112002011121 - 238 = 1837124104177 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2112002011096 and 2112002011105.
It is not a weakly prime, because it can be changed into another prime (2112002011181) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1056001005560 + 1056001005561.
It is an arithmetic number, because the mean of its divisors is an integer number (1056001005561).
Almost surely, 22112002011121 is an apocalyptic number.
It is an amenable number.
2112002011121 is a deficient number, since it is larger than the sum of its proper divisors (1).
2112002011121 is an equidigital number, since it uses as much as digits as its factorization.
2112002011121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 2112002011121 its reverse (1211102002112), we get a palindrome (3323104013233).
Subtracting from 2112002011121 its reverse (1211102002112), we obtain a palindrome (900900009009).
The spelling of 2112002011121 in words is "two trillion, one hundred twelve billion, two million, eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •