Base | Representation |
---|---|
bin | 1100011010000… |
… | …10001101111000 |
3 | 21020211211021000 |
4 | 12031002031320 |
5 | 203121031443 |
6 | 14154445000 |
7 | 2402444646 |
oct | 615021570 |
9 | 236754230 |
10 | 104080248 |
11 | 53829038 |
12 | 2aa33760 |
13 | 18741a5c |
14 | db74196 |
15 | 920d8d3 |
hex | 6342378 |
104080248 has 64 divisors (see below), whose sum is σ = 294048000. Its totient is φ = 34101216.
The previous prime is 104080211. The next prime is 104080289. The reversal of 104080248 is 842080401.
104080248 is a `hidden beast` number, since 10 + 408 + 0 + 248 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8661 + ... + 16827.
It is an arithmetic number, because the mean of its divisors is an integer number (4594500).
Almost surely, 2104080248 is an apocalyptic number.
104080248 is a gapful number since it is divisible by the number (18) 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 104080248, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (147024000).
104080248 is an abundant number, since it is smaller than the sum of its proper divisors (189967752).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104080248 is a wasteful number, since it uses less digits than its factorization.
104080248 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8241 (or 8231 counting only the distinct ones).
The product of its (nonzero) digits is 2048, while the sum is 27.
The square root of 104080248 is about 10201.9727504047. The cubic root of 104080248 is about 470.3878615152.
The spelling of 104080248 in words is "one hundred four million, eighty thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •