Base | Representation |
---|---|
bin | 1100100000100… |
… | …10010100000000 |
3 | 21022110010110220 |
4 | 12100102110000 |
5 | 203330320413 |
6 | 14225023040 |
7 | 2412624654 |
oct | 620222400 |
9 | 238403426 |
10 | 104932608 |
11 | 54260470 |
12 | 2b184a80 |
13 | 1897ca01 |
14 | dd16a64 |
15 | 932b223 |
hex | 6412500 |
104932608 has 72 divisors (see below), whose sum is σ = 304686816. Its totient is φ = 31795200.
The previous prime is 104932603. The next prime is 104932657. The reversal of 104932608 is 806239401.
It is a super-2 number, since 2×1049326082 = 22021704443363328, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104932603) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2238 + ... + 14658.
Almost surely, 2104932608 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 104932608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (152343408).
104932608 is an abundant number, since it is smaller than the sum of its proper divisors (199754208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104932608 is a wasteful number, since it uses less digits than its factorization.
104932608 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12451 (or 12437 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 33.
The square root of 104932608 is about 10243.6618452583. The cubic root of 104932608 is about 471.6684447374.
The spelling of 104932608 in words is "one hundred four million, nine hundred thirty-two thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •