| Base | Representation |
|---|---|
| bin | 110000110100111010… |
| … | …1101110000010101000 |
| 3 | 101000122112000001220000 |
| 4 | 1201221311232002220 |
| 5 | 3204220323430000 |
| 6 | 120100352303000 |
| 7 | 10401254662326 |
| oct | 1415165560250 |
| 9 | 330575001800 |
| 10 | 104854905000 |
| 11 | 4051795108a |
| 12 | 183a3841a60 |
| 13 | 9b70598bb1 |
| 14 | 5109b52d16 |
| 15 | 2ada580000 |
| hex | 1869d6e0a8 |
104854905000 has 400 divisors, whose sum is σ = 371247178500. Its totient is φ = 27637632000.
The previous prime is 104854904989. The next prime is 104854905011. The reversal of 104854905000 is 509458401.
104854905000 is a `hidden beast` number, since 10 + 4 + 8 + 54 + 90 + 500 + 0 = 666.
It is an interprime number because it is at equal distance from previous prime (104854904989) and next prime (104854905011).
It can be written as a sum of positive squares in 10 ways, for example, as 6094300356 + 98760604644 = 78066^2 + 314262^2 .
It is a super-2 number, since 2×1048549050002 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 99 ways as a sum of consecutive naturals, for example, 36043546 + ... + 36046454.
Almost surely, 2104854905000 is an apocalyptic number.
104854905000 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 104854905000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (185623589250).
104854905000 is an abundant number, since it is smaller than the sum of its proper divisors (266392273500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104854905000 is an equidigital number, since it uses as much as digits as its factorization.
104854905000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3036 (or 3008 counting only the distinct ones).
The product of its (nonzero) digits is 28800, while the sum is 36.
It can be divided in two parts, 10485490 and 5000, that added together give a triangular number (10490490 = T4580).
The spelling of 104854905000 in words is "one hundred four billion, eight hundred fifty-four million, nine hundred five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •