Base | Representation |
---|---|
bin | 1010111010101011100001… |
… | …1001000011110111101100 |
3 | 1120111111102220000222200210 |
4 | 2232222320121003313230 |
5 | 3033130104420432340 |
6 | 41310113031222420 |
7 | 2346130166202420 |
oct | 256527031036754 |
9 | 46444386028623 |
10 | 12003232202220 |
11 | 39085a6722206 |
12 | 141a382217a10 |
13 | 690b9122488c |
14 | 2d6d60d8ab80 |
15 | 15c371a80180 |
hex | aeab8643dec |
12003232202220 has 96 divisors (see below), whose sum is σ = 38414443189248. Its totient is φ = 2743303064832.
The previous prime is 12003232202183. The next prime is 12003232202237. The reversal of 12003232202220 is 2220223230021.
It is a super-2 number, since 2×120032322022202 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2426089 + ... + 5467391.
It is an arithmetic number, because the mean of its divisors is an integer number (400150449888).
Almost surely, 212003232202220 is an apocalyptic number.
12003232202220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12003232202220 is an abundant number, since it is smaller than the sum of its proper divisors (26411210987028).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12003232202220 is a wasteful number, since it uses less digits than its factorization.
12003232202220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3050719 (or 3050717 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 21.
Adding to 12003232202220 its reverse (2220223230021), we get a palindrome (14223455432241).
The spelling of 12003232202220 in words is "twelve trillion, three billion, two hundred thirty-two million, two hundred two thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •