Base | Representation |
---|---|
bin | 110000110110101010… |
… | …1101011010100010100 |
3 | 101000210121110210122010 |
4 | 1201231111223110110 |
5 | 3204330341122400 |
6 | 120110250504220 |
7 | 10402600002021 |
oct | 1415525532424 |
9 | 330717423563 |
10 | 104913614100 |
11 | 405480000a9 |
12 | 183bb435070 |
13 | 9b7c7b33c9 |
14 | 5113876548 |
15 | 2ae07ca450 |
hex | 186d56b514 |
104913614100 has 72 divisors (see below), whose sum is σ = 303951705568. Its totient is φ = 27939945600.
The previous prime is 104913613951. The next prime is 104913614111. The reversal of 104913614100 is 1416319401.
It is a super-2 number, since 2×1049136141002 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3886 + ... + 458085.
Almost surely, 2104913614100 is an apocalyptic number.
104913614100 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 104913614100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (151975852784).
104913614100 is an abundant number, since it is smaller than the sum of its proper divisors (199038091468).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104913614100 is a wasteful number, since it uses less digits than its factorization.
104913614100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 462745 (or 462738 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 30.
The spelling of 104913614100 in words is "one hundred four billion, nine hundred thirteen million, six hundred fourteen thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •