Base | Representation |
---|---|
bin | 110000110011100110… |
… | …0011001001000001000 |
3 | 101000112102110221000000 |
4 | 1201213030121020020 |
5 | 3204122443021000 |
6 | 120052125043000 |
7 | 10400205460260 |
oct | 1414714311010 |
9 | 330472427000 |
10 | 104810517000 |
11 | 404a4893792 |
12 | 183909b6460 |
13 | 9b64326cc7 |
14 | 5103cba7a0 |
15 | 2ad6713000 |
hex | 1867319208 |
104810517000 has 1792 divisors, whose sum is σ = 471420518400. Its totient is φ = 21247142400.
The previous prime is 104810516971. The next prime is 104810517001. The reversal of 104810517000 is 715018401.
104810517000 is a `hidden beast` number, since 10 + 481 + 0 + 5 + 170 + 0 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (104810517001) by changing a digit.
It is a polite number, since it can be written in 447 ways as a sum of consecutive naturals, for example, 2230010977 + ... + 2230011023.
Almost surely, 2104810517000 is an apocalyptic number.
104810517000 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 104810517000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (235710259200).
104810517000 is an abundant number, since it is smaller than the sum of its proper divisors (366610001400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104810517000 is a wasteful number, since it uses less digits than its factorization.
104810517000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 135 (or 106 counting only the distinct ones).
The product of its (nonzero) digits is 1120, while the sum is 27.
The spelling of 104810517000 in words is "one hundred four billion, eight hundred ten million, five hundred seventeen thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •