Base | Representation |
---|---|
bin | 1010111010100000010011… |
… | …1010010100011110101001 |
3 | 1120111012200000222012010221 |
4 | 2232220010322110132221 |
5 | 3033102423040201441 |
6 | 41304454143210041 |
7 | 2345662443453613 |
oct | 256500472243651 |
9 | 46435600865127 |
10 | 12000221022121 |
11 | 39072a0a16012 |
12 | 14198818a6921 |
13 | 6908014275c7 |
14 | 2d6b570b3db3 |
15 | 15c24752d8d1 |
hex | aea04e947a9 |
12000221022121 has 8 divisors (see below), whose sum is σ = 12087529927200. Its totient is φ = 11912926065600.
The previous prime is 12000221022091. The next prime is 12000221022149. The reversal of 12000221022121 is 12122012200021.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12000221022121 - 225 = 12000187467689 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12000221022095 and 12000221022104.
It is not an unprimeable number, because it can be changed into a prime (12000221028121) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1757131 + ... + 5204608.
It is an arithmetic number, because the mean of its divisors is an integer number (1510941240900).
Almost surely, 212000221022121 is an apocalyptic number.
It is an amenable number.
12000221022121 is a deficient number, since it is larger than the sum of its proper divisors (87308905079).
12000221022121 is a wasteful number, since it uses less digits than its factorization.
12000221022121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6974279.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 12000221022121 its reverse (12122012200021), we get a palindrome (24122233222142).
The spelling of 12000221022121 in words is "twelve trillion, two hundred twenty-one million, twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •