Base | Representation |
---|---|
bin | 1011000110101101111000… |
… | …0001100101000101010110 |
3 | 1121020021012102112201010200 |
4 | 2301223132001211011112 |
5 | 3100022111113324342 |
6 | 41545112350401330 |
7 | 2400100504445100 |
oct | 261533601450526 |
9 | 47207172481120 |
10 | 12210022011222 |
11 | 3988272124402 |
12 | 1452473800246 |
13 | 6a7528134bc9 |
14 | 302d7ab12570 |
15 | 16292614e94c |
hex | b1ade065156 |
12210022011222 has 72 divisors (see below), whose sum is σ = 30978042396912. Its totient is φ = 3465474516000.
The previous prime is 12210022011193. The next prime is 12210022011233. The reversal of 12210022011222 is 22211022001221.
It is a happy number.
12210022011222 is a `hidden beast` number, since 1 + 2 + 210 + 0 + 220 + 11 + 222 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 12210022011195 and 12210022011204.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 45706429 + ... + 45972792.
It is an arithmetic number, because the mean of its divisors is an integer number (430250588846).
Almost surely, 212210022011222 is an apocalyptic number.
12210022011222 is an abundant number, since it is smaller than the sum of its proper divisors (18768020385690).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12210022011222 is a wasteful number, since it uses less digits than its factorization.
12210022011222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91679394 (or 91679384 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 12210022011222 its reverse (22211022001221), we get a palindrome (34421044012443).
The spelling of 12210022011222 in words is "twelve trillion, two hundred ten billion, twenty-two million, eleven thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •