Base | Representation |
---|---|
bin | 10110000110001011… |
… | …011000101010000000 |
3 | 2021020111121001110120 |
4 | 112012023120222000 |
5 | 342042321434000 |
6 | 14522145500240 |
7 | 1466644254240 |
oct | 260613305200 |
9 | 67214531416 |
10 | 23725968000 |
11 | a075765a19 |
12 | 4721941680 |
13 | 23115c1227 |
14 | 12110a5b20 |
15 | 93ce116a0 |
hex | 5862d8a80 |
23725968000 has 512 divisors, whose sum is σ = 90568558080. Its totient is φ = 5382144000.
The previous prime is 23725967989. The next prime is 23725968029. The reversal of 23725968000 is 86952732.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 80975854 + ... + 80976146.
It is an arithmetic number, because the mean of its divisors is an integer number (176891715).
Almost surely, 223725968000 is an apocalyptic number.
23725968000 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 23725968000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (45284279040).
23725968000 is an abundant number, since it is smaller than the sum of its proper divisors (66842590080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23725968000 is a wasteful number, since it uses less digits than its factorization.
23725968000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 573 (or 551 counting only the distinct ones).
The product of its (nonzero) digits is 181440, while the sum is 42.
The spelling of 23725968000 in words is "twenty-three billion, seven hundred twenty-five million, nine hundred sixty-eight thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •