Base | Representation |
---|---|
bin | 10110011001000001… |
… | …00000111100011000 |
3 | 1011000202122120221000 |
4 | 23030200200330120 |
5 | 144104334311300 |
6 | 5304455545000 |
7 | 603614620653 |
oct | 131440407430 |
9 | 34022576830 |
10 | 12021010200 |
11 | 5109601981 |
12 | 23b598b160 |
13 | 119760c9b4 |
14 | 82072a89a |
15 | 4a5520c00 |
hex | 2cc820f18 |
12021010200 has 192 divisors, whose sum is σ = 41710500000. Its totient is φ = 3182008320.
The previous prime is 12021010181. The next prime is 12021010241. The reversal of 12021010200 is 201012021.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
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, 731676 + ... + 747924.
Almost surely, 212021010200 is an apocalyptic number.
12021010200 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 12021010200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20855250000).
12021010200 is an abundant number, since it is smaller than the sum of its proper divisors (29689489800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12021010200 is a wasteful number, since it uses less digits than its factorization.
12021010200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16411 (or 16396 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 12021010200 its reverse (201012021), we get a palindrome (12222022221).
The spelling of 12021010200 in words is "twelve billion, twenty-one million, ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •