Base | Representation |
---|---|
bin | 110000110111000101… |
… | …0111010010110000000 |
3 | 101000211120201210112122 |
4 | 1201232022322112000 |
5 | 3204342424204110 |
6 | 120111505543412 |
7 | 10403126423462 |
oct | 1415612722600 |
9 | 330746653478 |
10 | 104927569280 |
11 | 40554971906 |
12 | 18404044b68 |
13 | 9b8265b301 |
14 | 511566a132 |
15 | 2ae1b35255 |
hex | 186e2ba580 |
104927569280 has 128 divisors (see below), whose sum is σ = 253515981600. Its totient is φ = 41525084160.
The previous prime is 104927569249. The next prime is 104927569321. The reversal of 104927569280 is 82965729401.
It is a tau number, because it is divible by the number of its divisors (128).
It is a super-2 number, since 2×1049275692802 (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 15 ways as a sum of consecutive naturals, for example, 58650626 + ... + 58652414.
Almost surely, 2104927569280 is an apocalyptic number.
104927569280 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 104927569280, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (126757990800).
104927569280 is an abundant number, since it is smaller than the sum of its proper divisors (148588412320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104927569280 is a wasteful number, since it uses less digits than its factorization.
104927569280 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2732 (or 2720 counting only the distinct ones).
The product of its (nonzero) digits is 2177280, while the sum is 53.
The spelling of 104927569280 in words is "one hundred four billion, nine hundred twenty-seven million, five hundred sixty-nine thousand, two hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •