Base | Representation |
---|---|
bin | 1100011010001… |
… | …10000110100000 |
3 | 21020212122002100 |
4 | 12031012012200 |
5 | 203122034120 |
6 | 14155050400 |
7 | 2402542230 |
oct | 615060640 |
9 | 236778070 |
10 | 104096160 |
11 | 53839a93 |
12 | 2aa40a00 |
13 | 1874907c |
14 | db79cc0 |
15 | 9213490 |
hex | 63461a0 |
104096160 has 288 divisors, whose sum is σ = 424569600. Its totient is φ = 22708224.
The previous prime is 104096159. The next prime is 104096221. The reversal of 104096160 is 61690401.
104096160 is a `hidden beast` number, since 1 + 0 + 40 + 9 + 616 + 0 = 666.
It is a tau number, because it is divible by the number of its divisors (288).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 231616 + ... + 232064.
It is an arithmetic number, because the mean of its divisors is an integer number (1474200).
Almost surely, 2104096160 is an apocalyptic number.
104096160 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 104096160, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (212284800).
104096160 is an abundant number, since it is smaller than the sum of its proper divisors (320473440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104096160 is a wasteful number, since it uses less digits than its factorization.
104096160 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 500 (or 489 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 27.
The square root of 104096160 is about 10202.7525697725. The cubic root of 104096160 is about 470.4118315780.
The spelling of 104096160 in words is "one hundred four million, ninety-six thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •