Base | Representation |
---|---|
bin | 110000100101010011… |
… | …1010010011010001110 |
3 | 100222022000020100220020 |
4 | 1201022213102122032 |
5 | 3202132220344420 |
6 | 115532400003010 |
7 | 10352264051421 |
oct | 1411247223216 |
9 | 328260210806 |
10 | 104331028110 |
11 | 40279166681 |
12 | 18278300466 |
13 | 9ab8ba3b7a |
14 | 509a3439b8 |
15 | 2aa959c340 |
hex | 184a9d268e |
104331028110 has 32 divisors (see below), whose sum is σ = 250666997760. Its totient is φ = 27791326368.
The previous prime is 104331028099. The next prime is 104331028141. The reversal of 104331028110 is 11820133401.
It is a super-2 number, since 2×1043310281102 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 1864542 + ... + 1919681.
It is an arithmetic number, because the mean of its divisors is an integer number (7833343680).
Almost surely, 2104331028110 is an apocalyptic number.
104331028110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
104331028110 is an abundant number, since it is smaller than the sum of its proper divisors (146335969650).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104331028110 is a wasteful number, since it uses less digits than its factorization.
104331028110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3785152.
The product of its (nonzero) digits is 576, while the sum is 24.
The spelling of 104331028110 in words is "one hundred four billion, three hundred thirty-one million, twenty-eight thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •