Base | Representation |
---|---|
bin | 1010111011101110100010… |
… | …0111101001000011111001 |
3 | 1120120012212120111202200022 |
4 | 2232323220213221003321 |
5 | 3033423430111400441 |
6 | 41322250042020225 |
7 | 2350335032152430 |
oct | 256735047510371 |
9 | 46505776452608 |
10 | 12021221200121 |
11 | 3915197a7a621 |
12 | 14219627a7675 |
13 | 69279a0a2433 |
14 | 2d7b8a152117 |
15 | 15ca75eb384b |
hex | aeee89e90f9 |
12021221200121 has 8 divisors (see below), whose sum is σ = 13814442043584. Its totient is φ = 10246976238960.
The previous prime is 12021221200117. The next prime is 12021221200123. The reversal of 12021221200121 is 12100212212021.
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 12021221200121 - 22 = 12021221200117 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 12021221200121.
It is not an unprimeable number, because it can be changed into a prime (12021221200123) 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, 4743969215 + ... + 4743971748.
It is an arithmetic number, because the mean of its divisors is an integer number (1726805255448).
Almost surely, 212021221200121 is an apocalyptic number.
It is an amenable number.
12021221200121 is a deficient number, since it is larger than the sum of its proper divisors (1793220843463).
12021221200121 is an equidigital number, since it uses as much as digits as its factorization.
12021221200121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9487941151.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 12021221200121 its reverse (12100212212021), we get a palindrome (24121433412142).
The spelling of 12021221200121 in words is "twelve trillion, twenty-one billion, two hundred twenty-one million, two hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •