Base | Representation |
---|---|
bin | 1100011100011… |
… | …00110011000100 |
3 | 21021102100022020 |
4 | 12032030303010 |
5 | 203210320412 |
6 | 14205203140 |
7 | 2405156403 |
oct | 616146304 |
9 | 237370266 |
10 | 104385732 |
11 | 53a17600 |
12 | 2ab604b0 |
13 | 1881ab09 |
14 | dc1363a |
15 | 926e18c |
hex | 638ccc4 |
104385732 has 144 divisors (see below), whose sum is σ = 288684480. Its totient is φ = 29272320.
The previous prime is 104385727. The next prime is 104385733. The reversal of 104385732 is 237583401.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 104385693 and 104385702.
It is not an unprimeable number, because it can be changed into a prime (104385733) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1557963 + ... + 1558029.
Almost surely, 2104385732 is an apocalyptic number.
104385732 is a gapful number since it is divisible by the number (12) 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 104385732, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (144342240).
104385732 is an abundant number, since it is smaller than the sum of its proper divisors (184298748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104385732 is a wasteful number, since it uses less digits than its factorization.
104385732 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 162 (or 149 counting only the distinct ones).
The product of its (nonzero) digits is 20160, while the sum is 33.
The square root of 104385732 is about 10216.9335908579. The cubic root of 104385732 is about 470.8476208854.
The spelling of 104385732 in words is "one hundred four million, three hundred eighty-five thousand, seven hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •