Base | Representation |
---|---|
bin | 10110101111100100… |
… | …10010110010101000 |
3 | 1011111221200110020210 |
4 | 23113302102302220 |
5 | 200001304021300 |
6 | 5335335221120 |
7 | 611403105423 |
oct | 132762226250 |
9 | 34457613223 |
10 | 12210220200 |
11 | 51a6395182 |
12 | 24492177a0 |
13 | 11c7889989 |
14 | 83b9009ba |
15 | 4b6e48050 |
hex | 2d7c92ca8 |
12210220200 has 48 divisors (see below), whose sum is σ = 37851684480. Its totient is φ = 3256058560.
The previous prime is 12210220163. The next prime is 12210220219. The reversal of 12210220200 is 202201221.
12210220200 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 10174584 + ... + 10175783.
It is an arithmetic number, because the mean of its divisors is an integer number (788576760).
Almost surely, 212210220200 is an apocalyptic number.
12210220200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12210220200 is an abundant number, since it is smaller than the sum of its proper divisors (25641464280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12210220200 is a wasteful number, since it uses less digits than its factorization.
12210220200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20350386 (or 20350377 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 12210220200 its reverse (202201221), we get a palindrome (12412421421).
The spelling of 12210220200 in words is "twelve billion, two hundred ten million, two hundred twenty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •