Base | Representation |
---|---|
bin | 1010111010100011101010… |
… | …0111101111001000011101 |
3 | 1120111021222211112201100122 |
4 | 2232220322213233020131 |
5 | 3033111244230321341 |
6 | 41305123413004325 |
7 | 2346023664615023 |
oct | 256507247571035 |
9 | 46437884481318 |
10 | 12001122120221 |
11 | 3907713628393 |
12 | 1419a936236a5 |
13 | 690916016a50 |
14 | 2d6c00a38713 |
15 | 15c29b6c594b |
hex | aea3a9ef21d |
12001122120221 has 32 divisors (see below), whose sum is σ = 14157226137600. Its totient is φ = 10066211527680.
The previous prime is 12001122120217. The next prime is 12001122120259. The reversal of 12001122120221 is 12202122110021.
It is a cyclic number.
It is not a de Polignac number, because 12001122120221 - 22 = 12001122120217 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a self number, because there is not a number n which added to its sum of digits gives 12001122120221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12001122120521) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 141461906 + ... + 141546716.
It is an arithmetic number, because the mean of its divisors is an integer number (442413316800).
Almost surely, 212001122120221 is an apocalyptic number.
It is an amenable number.
12001122120221 is a deficient number, since it is larger than the sum of its proper divisors (2156104017379).
12001122120221 is a wasteful number, since it uses less digits than its factorization.
12001122120221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106949.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 12001122120221 its reverse (12202122110021), we get a palindrome (24203244230242).
The spelling of 12001122120221 in words is "twelve trillion, one billion, one hundred twenty-two million, one hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •