Base | Representation |
---|---|
bin | 100100011100110100110… |
… | …1001011010010010100000 |
3 | 122201220220220112012002122 |
4 | 1020321221221122102200 |
5 | 1124034333302033100 |
6 | 14353232034003412 |
7 | 1024640100131450 |
oct | 110715151322240 |
9 | 18656826465078 |
10 | 5009704330400 |
11 | 1661670545630 |
12 | 68aab7a16568 |
13 | 2a454a73b9c3 |
14 | 134684541d60 |
15 | 8a4a9678985 |
hex | 48e69a5a4a0 |
5009704330400 has 576 divisors, whose sum is σ = 15366300493824. Its totient is φ = 1549380096000.
The previous prime is 5009704330399. The next prime is 5009704330429. The reversal of 5009704330400 is 40334079005.
It is a Harshad number since it is a multiple of its sum of digits (35).
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 5647918757 + ... + 5647919643.
It is an arithmetic number, because the mean of its divisors is an integer number (26677605024).
Almost surely, 25009704330400 is an apocalyptic number.
5009704330400 is a gapful number since it is divisible by the number (50) 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 5009704330400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7683150246912).
5009704330400 is an abundant number, since it is smaller than the sum of its proper divisors (10356596163424).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5009704330400 is a wasteful number, since it uses less digits than its factorization.
5009704330400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1533 (or 1520 counting only the distinct ones).
The product of its (nonzero) digits is 45360, while the sum is 35.
The spelling of 5009704330400 in words is "five trillion, nine billion, seven hundred four million, three hundred thirty thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •