Base | Representation |
---|---|
bin | 1011000000111101101111… |
… | …0101110010111101111001 |
3 | 1120212211010102121022012221 |
4 | 2300033123311302331321 |
5 | 3041412214441320441 |
6 | 41431450424004041 |
7 | 2360001565644625 |
oct | 260173365627571 |
9 | 46784112538187 |
10 | 12111201120121 |
11 | 394a371326274 |
12 | 1437294900621 |
13 | 69b1099b3a4c |
14 | 2dc284504185 |
15 | 1600906c58d1 |
hex | b03dbd72f79 |
12111201120121 has 2 divisors, whose sum is σ = 12111201120122. Its totient is φ = 12111201120120.
The previous prime is 12111201120071. The next prime is 12111201120127. The reversal of 12111201120121 is 12102110211121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10770283439721 + 1340917680400 = 3281811^2 + 1157980^2 .
It is a cyclic number.
It is not a de Polignac number, because 12111201120121 - 29 = 12111201119609 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12111201120095 and 12111201120104.
It is not a weakly prime, because it can be changed into another prime (12111201120127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6055600560060 + 6055600560061.
It is an arithmetic number, because the mean of its divisors is an integer number (6055600560061).
Almost surely, 212111201120121 is an apocalyptic number.
It is an amenable number.
12111201120121 is a deficient number, since it is larger than the sum of its proper divisors (1).
12111201120121 is an equidigital number, since it uses as much as digits as its factorization.
12111201120121 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 16.
Adding to 12111201120121 its reverse (12102110211121), we get a palindrome (24213311331242).
The spelling of 12111201120121 in words is "twelve trillion, one hundred eleven billion, two hundred one million, one hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •