Base | Representation |
---|---|
bin | 110000011101001100… |
… | …1110111111100110000 |
3 | 100221121001111210021200 |
4 | 1200322121313330300 |
5 | 3201103110421100 |
6 | 115445403051200 |
7 | 10342452361326 |
oct | 1407231677460 |
9 | 327531453250 |
10 | 104059076400 |
11 | 401496aa2a4 |
12 | 18201210b00 |
13 | 9a747468b6 |
14 | 5072191d16 |
15 | 2a9077de00 |
hex | 183a677f30 |
104059076400 has 720 divisors, whose sum is σ = 386596184832. Its totient is φ = 25878528000.
The previous prime is 104059076389. The next prime is 104059076419. The reversal of 104059076400 is 4670950401.
104059076400 is a `hidden beast` number, since 1 + 0 + 4 + 0 + 5 + 9 + 0 + 7 + 640 + 0 = 666.
It is a tau number, because it is divible by the number of its divisors (720).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 431780280 + ... + 431780520.
Almost surely, 2104059076400 is an apocalyptic number.
104059076400 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 104059076400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (193298092416).
104059076400 is an abundant number, since it is smaller than the sum of its proper divisors (282537108432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104059076400 is a wasteful number, since it uses less digits than its factorization.
104059076400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 422 (or 408 counting only the distinct ones).
The product of its (nonzero) digits is 30240, while the sum is 36.
The spelling of 104059076400 in words is "one hundred four billion, fifty-nine million, seventy-six thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •