Base | Representation |
---|---|
bin | 10110101111100101… |
… | …01011001101001000 |
3 | 1011111221212112102111 |
4 | 23113302223031020 |
5 | 200001320221300 |
6 | 5335341312104 |
7 | 611404003111 |
oct | 132762531510 |
9 | 34457775374 |
10 | 12210320200 |
11 | 51a6453321 |
12 | 2449265634 |
13 | 11c78c3350 |
14 | 83b929208 |
15 | 4b6e679ba |
hex | 2d7cab348 |
12210320200 has 96 divisors (see below), whose sum is σ = 31149959400. Its totient is φ = 4423311360.
The previous prime is 12210320197. The next prime is 12210320231. The reversal of 12210320200 is 202301221.
It can be written as a sum of positive squares in 12 ways, for example, as 2758980676 + 9451339524 = 52526^2 + 97218^2 .
It is a Harshad number since it is a multiple of its sum of digits (13).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 93496 + ... + 182104.
Almost surely, 212210320200 is an apocalyptic number.
12210320200 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 12210320200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15574979700).
12210320200 is an abundant number, since it is smaller than the sum of its proper divisors (18939639200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12210320200 is a wasteful number, since it uses less digits than its factorization.
12210320200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 88691 (or 88682 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 13.
Adding to 12210320200 its reverse (202301221), we get a palindrome (12412621421).
The spelling of 12210320200 in words is "twelve billion, two hundred ten million, three hundred twenty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •