Base | Representation |
---|---|
bin | 1100011111111… |
… | …00001101100000 |
3 | 21022021112022000 |
4 | 12033330031200 |
5 | 203314421310 |
6 | 14223044000 |
7 | 2412100020 |
oct | 617741540 |
9 | 238245260 |
10 | 104842080 |
11 | 541a9452 |
12 | 2b140600 |
13 | 1894a745 |
14 | dcd1a80 |
15 | 930e4c0 |
hex | 63fc360 |
104842080 has 192 divisors, whose sum is σ = 419489280. Its totient is φ = 23956992.
The previous prime is 104842063. The next prime is 104842081. The reversal of 104842080 is 80248401.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104842081) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 28507 + ... + 31973.
It is an arithmetic number, because the mean of its divisors is an integer number (2184840).
Almost surely, 2104842080 is an apocalyptic number.
104842080 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 104842080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (209744640).
104842080 is an abundant number, since it is smaller than the sum of its proper divisors (314647200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104842080 is a wasteful number, since it uses less digits than its factorization.
104842080 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3498 (or 3484 counting only the distinct ones).
The product of its (nonzero) digits is 2048, while the sum is 27.
The square root of 104842080 is about 10239.2421594569. The cubic root of 104842080 is about 471.5327656354.
The spelling of 104842080 in words is "one hundred four million, eight hundred forty-two thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •