Base | Representation |
---|---|
bin | 1100011110000… |
… | …01010111000000 |
3 | 21021211021122000 |
4 | 12033001113000 |
5 | 203234213044 |
6 | 14213544000 |
7 | 2410044153 |
oct | 617012700 |
9 | 237737560 |
10 | 104601024 |
11 | 54054330 |
12 | 2b045000 |
13 | 18894ac8 |
14 | dc6bc9a |
15 | 92b2d69 |
hex | 63c15c0 |
104601024 has 112 divisors (see below), whose sum is σ = 335523840. Its totient is φ = 31691520.
The previous prime is 104601019. The next prime is 104601053. The reversal of 104601024 is 420106401.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 104600988 and 104601006.
It is a congruent number.
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, 16257 + ... + 21759.
Almost surely, 2104601024 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 104601024, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (167761920).
104601024 is an abundant number, since it is smaller than the sum of its proper divisors (230922816).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104601024 is a wasteful number, since it uses less digits than its factorization.
104601024 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5535 (or 5519 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
The square root of 104601024 is about 10227.4642018440. The cubic root of 104601024 is about 471.1711009667.
Adding to 104601024 its reverse (420106401), we get a palindrome (524707425).
The spelling of 104601024 in words is "one hundred four million, six hundred one thousand, twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •