Base | Representation |
---|---|
bin | 110000100011100000… |
… | …1101101001111100000 |
3 | 100222010210222202001022 |
4 | 1201013001231033200 |
5 | 3202021314014041 |
6 | 115522410025012 |
7 | 10350633362231 |
oct | 1410701551740 |
9 | 328123882038 |
10 | 104270844896 |
11 | 402481a0089 |
12 | 18260118168 |
13 | 9aa95916ba |
14 | 5092359088 |
15 | 2aa416024b |
hex | 184706d3e0 |
104270844896 has 48 divisors (see below), whose sum is σ = 210312674208. Its totient is φ = 50868979200.
The previous prime is 104270844877. The next prime is 104270844917. The reversal of 104270844896 is 698448072401.
It is a Harshad number since it is a multiple of its sum of digits (53).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 137141 + ... + 476811.
It is an arithmetic number, because the mean of its divisors is an integer number (4381514046).
Almost surely, 2104270844896 is an apocalyptic number.
104270844896 is a gapful number since it is divisible by the number (16) 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 104270844896, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (105156337104).
104270844896 is an abundant number, since it is smaller than the sum of its proper divisors (106041829312).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104270844896 is a wasteful number, since it uses less digits than its factorization.
104270844896 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 339915 (or 339907 counting only the distinct ones).
The product of its (nonzero) digits is 3096576, while the sum is 53.
The spelling of 104270844896 in words is "one hundred four billion, two hundred seventy million, eight hundred forty-four thousand, eight hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •