Base | Representation |
---|---|
bin | 1010111011110010001110… |
… | …1100000011010111101011 |
3 | 1120120022102122021101200111 |
4 | 2232330203230003113223 |
5 | 3033432442311242303 |
6 | 41322532242515151 |
7 | 2350401424500454 |
oct | 256744354032753 |
9 | 46508378241614 |
10 | 12022212212203 |
11 | 3915656414676 |
12 | 1421b9a665ab7 |
13 | 6928c74b360b |
14 | 2d7c41a0012b |
15 | 15cad2ebbb6d |
hex | aef23b035eb |
12022212212203 has 8 divisors (see below), whose sum is σ = 12729597210288. Its totient is φ = 11314848996864.
The previous prime is 12022212212137. The next prime is 12022212212207. The reversal of 12022212212203 is 30221221222021.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12022212212203 - 213 = 12022212204011 is a prime.
It is a super-2 number, since 2×120222122122032 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12022212212207) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4302526 + ... + 6523507.
It is an arithmetic number, because the mean of its divisors is an integer number (1591199651286).
Almost surely, 212022212212203 is an apocalyptic number.
12022212212203 is a deficient number, since it is larger than the sum of its proper divisors (707384998085).
12022212212203 is a wasteful number, since it uses less digits than its factorization.
12022212212203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10891373.
The product of its (nonzero) digits is 768, while the sum is 22.
Adding to 12022212212203 its reverse (30221221222021), we get a palindrome (42243433434224).
The spelling of 12022212212203 in words is "twelve trillion, twenty-two billion, two hundred twelve million, two hundred twelve thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •