Base | Representation |
---|---|
bin | 1100100000100… |
… | …01011000000000 |
3 | 21022102221012200 |
4 | 12100101120000 |
5 | 203330210033 |
6 | 14224553200 |
7 | 2412610530 |
oct | 620213000 |
9 | 238387180 |
10 | 104928768 |
11 | 5425859a |
12 | 2b182800 |
13 | 1897b039 |
14 | dd154c0 |
15 | 932a013 |
hex | 6411600 |
104928768 has 120 divisors (see below), whose sum is σ = 346199568. Its totient is φ = 29970432.
The previous prime is 104928751. The next prime is 104928787. The reversal of 104928768 is 867829401.
It is a super-2 number, since 2×1049287682 = 22020092707995648, which 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 (7) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 30630 + ... + 33882.
Almost surely, 2104928768 is an apocalyptic number.
104928768 is a gapful number since it is divisible by the number (18) 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 104928768, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (173099784).
104928768 is an abundant number, since it is smaller than the sum of its proper divisors (241270800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104928768 is an equidigital number, since it uses as much as digits as its factorization.
104928768 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3284 (or 3265 counting only the distinct ones).
The product of its (nonzero) digits is 193536, while the sum is 45.
The square root of 104928768 is about 10243.4744105699. The cubic root of 104928768 is about 471.6626911115.
The spelling of 104928768 in words is "one hundred four million, nine hundred twenty-eight thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •