Base | Representation |
---|---|
bin | 10101011100110101… |
… | …010111111110101000 |
3 | 2012110011101201000202 |
4 | 111130311113332220 |
5 | 334132234112300 |
6 | 14325250451332 |
7 | 1443522410363 |
oct | 253465277650 |
9 | 65404351022 |
10 | 23032332200 |
11 | 984a173099 |
12 | 4569593b48 |
13 | 223099c847 |
14 | 1186d070da |
15 | 8ec099ad5 |
hex | 55cd57fa8 |
23032332200 has 192 divisors, whose sum is σ = 56276866800. Its totient is φ = 8758886400.
The previous prime is 23032332199. The next prime is 23032332259. The reversal of 23032332200 is 223323032.
It can be written as a sum of positive squares in 24 ways, for example, as 2502600676 + 20529731524 = 50026^2 + 143282^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 65247224 + ... + 65247576.
Almost surely, 223032332200 is an apocalyptic number.
23032332200 is a gapful number since it is divisible by the number (20) 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 23032332200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (28138433400).
23032332200 is an abundant number, since it is smaller than the sum of its proper divisors (33244534600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23032332200 is a wasteful number, since it uses less digits than its factorization.
23032332200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 592 (or 583 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 20.
Adding to 23032332200 its reverse (223323032), we get a palindrome (23255655232).
The spelling of 23032332200 in words is "twenty-three billion, thirty-two million, three hundred thirty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •