Base | Representation |
---|---|
bin | 1100011100010… |
… | …00010111001000 |
3 | 21021101102101012 |
4 | 12032020113020 |
5 | 203204230220 |
6 | 14204543052 |
7 | 2405052413 |
oct | 616102710 |
9 | 237342335 |
10 | 104367560 |
11 | 53a04990 |
12 | 2ab51a88 |
13 | 1881276b |
14 | dc0ab7a |
15 | 9268ac5 |
hex | 63885c8 |
104367560 has 64 divisors (see below), whose sum is σ = 267338880. Its totient is φ = 36298240.
The previous prime is 104367553. The next prime is 104367581. The reversal of 104367560 is 65763401.
104367560 = T346 + T347 + ... + T873.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4964 + ... + 15276.
It is an arithmetic number, because the mean of its divisors is an integer number (4177170).
Almost surely, 2104367560 is an apocalyptic number.
104367560 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 104367560, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (133669440).
104367560 is an abundant number, since it is smaller than the sum of its proper divisors (162971320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104367560 is a wasteful number, since it uses less digits than its factorization.
104367560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10358 (or 10354 counting only the distinct ones).
The product of its (nonzero) digits is 15120, while the sum is 32.
The square root of 104367560 is about 10216.0442442268. The cubic root of 104367560 is about 470.8202967823.
The spelling of 104367560 in words is "one hundred four million, three hundred sixty-seven thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •