Base | Representation |
---|---|
bin | 10110110001000111… |
… | …11101111111011000 |
3 | 1011112212012001002002 |
4 | 23120203331333120 |
5 | 200013122222300 |
6 | 5340522300132 |
7 | 611621562431 |
oct | 133043757730 |
9 | 34485161062 |
10 | 12223242200 |
11 | 5202779864 |
12 | 2451657648 |
13 | 11ca498bc0 |
14 | 83d530488 |
15 | 4b816b5d5 |
hex | 2d88fdfd8 |
12223242200 has 192 divisors, whose sum is σ = 31315183200. Its totient is φ = 4409856000.
The previous prime is 12223242197. The next prime is 12223242209. The reversal of 12223242200 is 224232221.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12223242209) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 23371139 + ... + 23371661.
Almost surely, 212223242200 is an apocalyptic number.
12223242200 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 12223242200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15657591600).
12223242200 is an abundant number, since it is smaller than the sum of its proper divisors (19091941000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12223242200 is a wasteful number, since it uses less digits than its factorization.
12223242200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 742 (or 733 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 20.
Adding to 12223242200 its reverse (224232221), we get a palindrome (12447474421).
The spelling of 12223242200 in words is "twelve billion, two hundred twenty-three million, two hundred forty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •