Base | Representation |
---|---|
bin | 1100011001110… |
… | …11000110111010 |
3 | 21020210100022120 |
4 | 12030323012322 |
5 | 203114114010 |
6 | 14154102110 |
7 | 2402264031 |
oct | 614730672 |
9 | 236710276 |
10 | 104051130 |
11 | 53809177 |
12 | 2aa1a936 |
13 | 18731721 |
14 | db67718 |
15 | 9204e70 |
hex | 633b1ba |
104051130 has 64 divisors (see below), whose sum is σ = 260064000. Its totient is φ = 26611200.
The previous prime is 104051119. The next prime is 104051147. The reversal of 104051130 is 31150401.
It is a super-3 number, since 3×1040511303 (a number of 25 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a Curzon number.
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, 172830 + ... + 173430.
It is an arithmetic number, because the mean of its divisors is an integer number (4063500).
Almost surely, 2104051130 is an apocalyptic number.
104051130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 104051130, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (130032000).
104051130 is an abundant number, since it is smaller than the sum of its proper divisors (156012870).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104051130 is a wasteful number, since it uses less digits than its factorization.
104051130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 839.
The product of its (nonzero) digits is 60, while the sum is 15.
The square root of 104051130 is about 10200.5455736446. The cubic root of 104051130 is about 470.3439914197.
The spelling of 104051130 in words is "one hundred four million, fifty-one thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •