Base | Representation |
---|---|
bin | 10101110010110101… |
… | …111000010111010000 |
3 | 2020101220011121021210 |
4 | 111302311320113100 |
5 | 340411300013400 |
6 | 14430040420120 |
7 | 1455625002642 |
oct | 256265702720 |
9 | 66356147253 |
10 | 23401563600 |
11 | 9a19633108 |
12 | 4651177640 |
13 | 228c32a36c |
14 | 11bdd7c892 |
15 | 91e6d1950 |
hex | 572d785d0 |
23401563600 has 120 divisors (see below), whose sum is σ = 75133932192. Its totient is φ = 6226188800.
The previous prime is 23401563599. The next prime is 23401563607. The reversal of 23401563600 is 636510432.
It is a tau number, because it is divible by the number of its divisors (120).
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23401563607) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 509590 + ... + 553610.
Almost surely, 223401563600 is an apocalyptic number.
23401563600 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 23401563600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (37566966096).
23401563600 is an abundant number, since it is smaller than the sum of its proper divisors (51732368592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23401563600 is a wasteful number, since it uses less digits than its factorization.
23401563600 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 44485 (or 44474 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 30.
The spelling of 23401563600 in words is "twenty-three billion, four hundred one million, five hundred sixty-three thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •