Base | Representation |
---|---|
bin | 1011000110101110100101… |
… | …0110010111110001101000 |
3 | 1121020021200200001200222122 |
4 | 2301223221112113301220 |
5 | 3100023003233323422 |
6 | 41545143255010412 |
7 | 2400105302432453 |
oct | 261535126276150 |
9 | 47207620050878 |
10 | 12210212011112 |
11 | 398835a3a7105 |
12 | 1452507369a08 |
13 | 6a75585ca58b |
14 | 302d9805049a |
15 | 162937b80d42 |
hex | b1ae9597c68 |
12210212011112 has 8 divisors (see below), whose sum is σ = 22894147520850. Its totient is φ = 6105106005552.
The previous prime is 12210212011031. The next prime is 12210212011117. The reversal of 12210212011112 is 21111021201221.
It can be written as a sum of positive squares in only one way, i.e., 11993851209796 + 216360801316 = 3463214^2 + 465146^2 .
It is a tau number, because it is divible by the number of its divisors (8).
It is a super-2 number, since 2×122102120111122 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (12210212011117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 763138250687 + ... + 763138250702.
Almost surely, 212210212011112 is an apocalyptic number.
It is an amenable number.
12210212011112 is a deficient number, since it is larger than the sum of its proper divisors (10683935509738).
12210212011112 is a wasteful number, since it uses less digits than its factorization.
12210212011112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1526276501395 (or 1526276501391 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 12210212011112 its reverse (21111021201221), we get a palindrome (33321233212333).
The spelling of 12210212011112 in words is "twelve trillion, two hundred ten billion, two hundred twelve million, eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •