Base | Representation |
---|---|
bin | 1010111011101110100101… |
… | …0000110101110001111001 |
3 | 1120120012220022211110111022 |
4 | 2232323221100311301321 |
5 | 3033423440343000441 |
6 | 41322251105312225 |
7 | 2350335223023341 |
oct | 256735120656171 |
9 | 46505808743438 |
10 | 12021232000121 |
11 | 39151a3086843 |
12 | 1421966335675 |
13 | 69279c3b4176 |
14 | 2d7b8b763d21 |
15 | 15ca76de884b |
hex | aeee9435c79 |
12021232000121 has 8 divisors (see below), whose sum is σ = 12654045814080. Its totient is φ = 11388429925488.
The previous prime is 12021232000087. The next prime is 12021232000133. The reversal of 12021232000121 is 12100023212021.
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 12021232000121 - 210 = 12021231999097 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12021232000121.
It is not an unprimeable number, because it can be changed into a prime (12021232000021) 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, 792806 + ... + 4966991.
It is an arithmetic number, because the mean of its divisors is an integer number (1581755726760).
Almost surely, 212021232000121 is an apocalyptic number.
It is an amenable number.
12021232000121 is a deficient number, since it is larger than the sum of its proper divisors (632813813959).
12021232000121 is a wasteful number, since it uses less digits than its factorization.
12021232000121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5869663.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 12021232000121 its reverse (12100023212021), we get a palindrome (24121255212142).
The spelling of 12021232000121 in words is "twelve trillion, twenty-one billion, two hundred thirty-two million, one hundred twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.299 sec. • engine limits •