Base | Representation |
---|---|
bin | 110000100100010010… |
… | …0011000011010110100 |
3 | 100222012121122220212000 |
4 | 1201020210120122310 |
5 | 3202044424234420 |
6 | 115525132255300 |
7 | 10351366265145 |
oct | 1411044303264 |
9 | 328177586760 |
10 | 104296711860 |
11 | 40260858340 |
12 | 18268911530 |
13 | 9ab1a4a3b3 |
14 | 509596dacc |
15 | 2aa656e690 |
hex | 18489186b4 |
104296711860 has 384 divisors, whose sum is σ = 378014515200. Its totient is φ = 23623488000.
The previous prime is 104296711793. The next prime is 104296711949. The reversal of 104296711860 is 68117692401.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 5330295 + ... + 5349825.
It is an arithmetic number, because the mean of its divisors is an integer number (984412800).
Almost surely, 2104296711860 is an apocalyptic number.
104296711860 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 104296711860, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (189007257600).
104296711860 is an abundant number, since it is smaller than the sum of its proper divisors (273717803340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104296711860 is a wasteful number, since it uses less digits than its factorization.
104296711860 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19620 (or 19612 counting only the distinct ones).
The product of its (nonzero) digits is 145152, while the sum is 45.
The spelling of 104296711860 in words is "one hundred four billion, two hundred ninety-six million, seven hundred eleven thousand, eight hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •