Base | Representation |
---|---|
bin | 110000101010011101… |
… | …1110001011001111110 |
3 | 100222202002000220001220 |
4 | 1201110323301121332 |
5 | 3203011031420420 |
6 | 120001503014210 |
7 | 10356465534534 |
oct | 1412473613176 |
9 | 328662026056 |
10 | 104504170110 |
11 | 4035797483a |
12 | 1830629a366 |
13 | 9b15a16362 |
14 | 50b5334154 |
15 | 2ab989d840 |
hex | 1854ef167e |
104504170110 has 128 divisors (see below), whose sum is σ = 269188254720. Its totient is φ = 25897107456.
The previous prime is 104504170093. The next prime is 104504170157. The reversal of 104504170110 is 11071405401.
It is a super-2 number, since 2×1045041701102 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 19629909 + ... + 19635231.
It is an arithmetic number, because the mean of its divisors is an integer number (2103033240).
Almost surely, 2104504170110 is an apocalyptic number.
104504170110 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 104504170110, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (134594127360).
104504170110 is an abundant number, since it is smaller than the sum of its proper divisors (164684084610).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104504170110 is a wasteful number, since it uses less digits than its factorization.
104504170110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6162.
The product of its (nonzero) digits is 560, while the sum is 24.
Adding to 104504170110 its reverse (11071405401), we get a palindrome (115575575511).
The spelling of 104504170110 in words is "one hundred four billion, five hundred four million, one hundred seventy thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •