Base | Representation |
---|---|
bin | 10101011100101011… |
… | …100000111000000000 |
3 | 2012102222112101002000 |
4 | 111130223200320000 |
5 | 334131103402300 |
6 | 14325115224000 |
7 | 1443461423055 |
oct | 253453407000 |
9 | 65388471060 |
10 | 23029747200 |
11 | 9848767a29 |
12 | 4568748000 |
13 | 22302a6065 |
14 | 118683302c |
15 | 8ebc38c00 |
hex | 55cae0e00 |
23029747200 has 480 divisors, whose sum is σ = 86863175520. Its totient is φ = 5971968000.
The previous prime is 23029747189. The next prime is 23029747319. The reversal of 23029747200 is 274792032.
It is a tau number, because it is divible by the number of its divisors (480).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
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, 12786300 + ... + 12788100.
It is an arithmetic number, because the mean of its divisors is an integer number (180964949).
Almost surely, 223029747200 is an apocalyptic number.
23029747200 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 23029747200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (43431587760).
23029747200 is an abundant number, since it is smaller than the sum of its proper divisors (63833428320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23029747200 is a wasteful number, since it uses less digits than its factorization.
23029747200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1875 (or 1848 counting only the distinct ones).
The product of its (nonzero) digits is 42336, while the sum is 36.
The spelling of 23029747200 in words is "twenty-three billion, twenty-nine million, seven hundred forty-seven thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •