Base | Representation |
---|---|
bin | 10110011001000101… |
… | …00110000001100100 |
3 | 1011000210200021122220 |
4 | 23030202212001210 |
5 | 144110004232200 |
6 | 5304515352340 |
7 | 603622351116 |
oct | 131442460144 |
9 | 34023607586 |
10 | 12021555300 |
11 | 5109944477 |
12 | 23b5bb26b0 |
13 | 1197770b41 |
14 | 82082d3b6 |
15 | 4a55cc4a0 |
hex | 2cc8a6064 |
12021555300 has 144 divisors (see below), whose sum is σ = 36079482432. Its totient is φ = 3087936000.
The previous prime is 12021555289. The next prime is 12021555311. The reversal of 12021555300 is 355512021.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (12021555289) and next prime (12021555311).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1115739 + ... + 1126461.
Almost surely, 212021555300 is an apocalyptic number.
12021555300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 12021555300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18039741216).
12021555300 is an abundant number, since it is smaller than the sum of its proper divisors (24057927132).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12021555300 is a wasteful number, since it uses less digits than its factorization.
12021555300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10878 (or 10871 counting only the distinct ones).
The product of its (nonzero) digits is 1500, while the sum is 24.
The spelling of 12021555300 in words is "twelve billion, twenty-one million, five hundred fifty-five thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •