Base | Representation |
---|---|
bin | 1010111011101110011101… |
… | …0111111101001101010001 |
3 | 1120120012211010012111100122 |
4 | 2232323213113331031101 |
5 | 3033423404234423441 |
6 | 41322244014200025 |
7 | 2350334356461521 |
oct | 256734727751521 |
9 | 46505733174318 |
10 | 12021200311121 |
11 | 3915187202391 |
12 | 14219577b3015 |
13 | 69279596a491 |
14 | 2d7b87475681 |
15 | 15ca7423934b |
hex | aeee75fd351 |
12021200311121 has 2 divisors, whose sum is σ = 12021200311122. Its totient is φ = 12021200311120.
The previous prime is 12021200311097. The next prime is 12021200311129. The reversal of 12021200311121 is 12111300212021.
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., 9260086355521 + 2761113955600 = 3043039^2 + 1661660^2 .
It is a cyclic number.
It is not a de Polignac number, because 12021200311121 - 222 = 12021196116817 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12021200311121.
It is not a weakly prime, because it can be changed into another prime (12021200311129) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6010600155560 + 6010600155561.
It is an arithmetic number, because the mean of its divisors is an integer number (6010600155561).
Almost surely, 212021200311121 is an apocalyptic number.
It is an amenable number.
12021200311121 is a deficient number, since it is larger than the sum of its proper divisors (1).
12021200311121 is an equidigital number, since it uses as much as digits as its factorization.
12021200311121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 12021200311121 its reverse (12111300212021), we get a palindrome (24132500523142).
The spelling of 12021200311121 in words is "twelve trillion, twenty-one billion, two hundred million, three hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •