Base | Representation |
---|---|
bin | 110000100000010000… |
… | …0011100000100010100 |
3 | 100221212012011102212101 |
4 | 1201000200130010110 |
5 | 3201310313214000 |
6 | 115503501331444 |
7 | 10345134543256 |
oct | 1410040340424 |
9 | 327765142771 |
10 | 104161460500 |
11 | 401a1479a59 |
12 | 1822b566b84 |
13 | 9a8ca135c6 |
14 | 5081a03cd6 |
15 | 2a99754e6a |
hex | 184081c114 |
104161460500 has 96 divisors (see below), whose sum is σ = 238314585600. Its totient is φ = 39718224000.
The previous prime is 104161460483. The next prime is 104161460531. The reversal of 104161460500 is 5064161401.
It is a super-3 number, since 3×1041614605003 (a number of 34 digits) contains 333 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1100035 + ... + 1190965.
It is an arithmetic number, because the mean of its divisors is an integer number (2482443600).
Almost surely, 2104161460500 is an apocalyptic number.
104161460500 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 104161460500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (119157292800).
104161460500 is an abundant number, since it is smaller than the sum of its proper divisors (134153125100).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104161460500 is a wasteful number, since it uses less digits than its factorization.
104161460500 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 91058 (or 91046 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 28.
The spelling of 104161460500 in words is "one hundred four billion, one hundred sixty-one million, four hundred sixty thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •