Base | Representation |
---|---|
bin | 1010111011101110011111… |
… | …1101011000011100100101 |
3 | 1120120012211210122221101022 |
4 | 2232323213331120130211 |
5 | 3033423414242401041 |
6 | 41322245004340525 |
7 | 2350334536042652 |
oct | 256734775303445 |
9 | 46505753587338 |
10 | 12021210122021 |
11 | 39151917a3471 |
12 | 142195ab44745 |
13 | 6927979c3c49 |
14 | 2d7b888aac29 |
15 | 15ca7502624b |
hex | aeee7f58725 |
12021210122021 has 4 divisors (see below), whose sum is σ = 12021411276000. Its totient is φ = 12021008968044.
The previous prime is 12021210122017. The next prime is 12021210122027. The reversal of 12021210122021 is 12022101212021.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 12021210122021 - 22 = 12021210122017 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12021210122027) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 100487321 + ... + 100606878.
It is an arithmetic number, because the mean of its divisors is an integer number (3005352819000).
Almost surely, 212021210122021 is an apocalyptic number.
It is an amenable number.
12021210122021 is a deficient number, since it is larger than the sum of its proper divisors (201153979).
12021210122021 is an equidigital number, since it uses as much as digits as its factorization.
12021210122021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 201153978.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 12021210122021 its reverse (12022101212021), we get a palindrome (24043311334042).
The spelling of 12021210122021 in words is "twelve trillion, twenty-one billion, two hundred ten million, one hundred twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •