Base | Representation |
---|---|
bin | 110000011101010111… |
… | …0011000100011000000 |
3 | 100221121102121221022121 |
4 | 1200322232120203000 |
5 | 3201110444442200 |
6 | 115450114214024 |
7 | 10342546153060 |
oct | 1407256304300 |
9 | 327542557277 |
10 | 104064452800 |
11 | 40151741700 |
12 | 18202b84314 |
13 | 9a758a9ab9 |
14 | 5072b913a0 |
15 | 2a90e91e1a |
hex | 183ab988c0 |
104064452800 has 504 divisors, whose sum is σ = 340663633632. Its totient is φ = 30520934400.
The previous prime is 104064452747. The next prime is 104064452801. The reversal of 104064452800 is 8254460401.
It is a Harshad number since it is a multiple of its sum of digits (34).
It is not an unprimeable number, because it can be changed into a prime (104064452801) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 23036142 + ... + 23040658.
It is an arithmetic number, because the mean of its divisors is an integer number (675919908).
Almost surely, 2104064452800 is an apocalyptic number.
104064452800 is a gapful number since it is divisible by the number (10) 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 104064452800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (170331816816).
104064452800 is an abundant number, since it is smaller than the sum of its proper divisors (236599180832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104064452800 is a wasteful number, since it uses less digits than its factorization.
104064452800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4585 (or 4559 counting only the distinct ones).
The product of its (nonzero) digits is 30720, while the sum is 34.
The spelling of 104064452800 in words is "one hundred four billion, sixty-four million, four hundred fifty-two thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •