Base | Representation |
---|---|
bin | 110000011100001001… |
… | …0111001101011000000 |
3 | 100221111120221011210000 |
4 | 1200320102321223000 |
5 | 3201020031202031 |
6 | 115442100440000 |
7 | 10341542544564 |
oct | 1407022715300 |
9 | 327446834700 |
10 | 104023694016 |
11 | 40130732a60 |
12 | 181b13a9000 |
13 | 9a6a308a88 |
14 | 506b5c16a4 |
15 | 2a8c5e03e6 |
hex | 18384b9ac0 |
104023694016 has 560 divisors, whose sum is σ = 359632056960. Its totient is φ = 29397012480.
The previous prime is 104023694011. The next prime is 104023694041. The reversal of 104023694016 is 610496320401.
104023694016 is a `hidden beast` number, since 10 + 4 + 0 + 236 + 9 + 401 + 6 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (104023694011) by changing a digit.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 72590836 + ... + 72592268.
Almost surely, 2104023694016 is an apocalyptic number.
104023694016 is a gapful number since it is divisible by the number (16) 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 104023694016, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (179816028480).
104023694016 is an abundant number, since it is smaller than the sum of its proper divisors (255608362944).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104023694016 is a wasteful number, since it uses less digits than its factorization.
104023694016 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1554 (or 1535 counting only the distinct ones).
The product of its (nonzero) digits is 31104, while the sum is 36.
The spelling of 104023694016 in words is "one hundred four billion, twenty-three million, six hundred ninety-four thousand, sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •