Base | Representation |
---|---|
bin | 1010111010100011101010… |
… | …0111101010101111000011 |
3 | 1120111021222211111210122121 |
4 | 2232220322213222233003 |
5 | 3033111244224232321 |
6 | 41305123412345111 |
7 | 2346023664511354 |
oct | 256507247525703 |
9 | 46437884453577 |
10 | 12001122102211 |
11 | 3907713615900 |
12 | 1419a93615197 |
13 | 69091600b7a8 |
14 | 2d6c00a31d2b |
15 | 15c29b6c0441 |
hex | aea3a9eabc3 |
12001122102211 has 96 divisors (see below), whose sum is σ = 13715063208000. Its totient is φ = 10489425408000.
The previous prime is 12001122102199. The next prime is 12001122102227. The reversal of 12001122102211 is 11220122110021.
It is not a de Polignac number, because 12001122102211 - 27 = 12001122102083 is a prime.
It is not an unprimeable number, because it can be changed into a prime (12001122102251) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 18211110600 + ... + 18211111258.
It is an arithmetic number, because the mean of its divisors is an integer number (142865241750).
Almost surely, 212001122102211 is an apocalyptic number.
12001122102211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
12001122102211 is a deficient number, since it is larger than the sum of its proper divisors (1713941105789).
12001122102211 is a wasteful number, since it uses less digits than its factorization.
12001122102211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1141 (or 1130 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 12001122102211 its reverse (11220122110021), we get a palindrome (23221244212232).
It can be divided in two parts, 120011 and 22102211, that added together give a palindrome (22222222).
The spelling of 12001122102211 in words is "twelve trillion, one billion, one hundred twenty-two million, one hundred two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •