Base | Representation |
---|---|
bin | 1100011111011… |
… | …01101001101000 |
3 | 21022011111111010 |
4 | 12033231221220 |
5 | 203311014230 |
6 | 14221503520 |
7 | 2411431110 |
oct | 617555150 |
9 | 238144433 |
10 | 104782440 |
11 | 54168664 |
12 | 2b111ba0 |
13 | 18929559 |
14 | dcb8040 |
15 | 92eb9b0 |
hex | 63eda68 |
104782440 has 128 divisors (see below), whose sum is σ = 364032000. Its totient is φ = 23632128.
The previous prime is 104782417. The next prime is 104782451. The reversal of 104782440 is 44287401.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 104782398 and 104782407.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 65571 + ... + 67149.
It is an arithmetic number, because the mean of its divisors is an integer number (2844000).
Almost surely, 2104782440 is an apocalyptic number.
104782440 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 104782440, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (182016000).
104782440 is an abundant number, since it is smaller than the sum of its proper divisors (259249560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104782440 is a wasteful number, since it uses less digits than its factorization.
104782440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1679 (or 1675 counting only the distinct ones).
The product of its (nonzero) digits is 7168, while the sum is 30.
The square root of 104782440 is about 10236.3294202561. The cubic root of 104782440 is about 471.4433373310.
The spelling of 104782440 in words is "one hundred four million, seven hundred eighty-two thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •