Base | Representation |
---|---|
bin | 110000100010111101… |
… | …0001100110110100000 |
3 | 100222002111201101212220 |
4 | 1201011322030312200 |
5 | 3202002014200000 |
6 | 115520500151040 |
7 | 10350315141336 |
oct | 1410572146640 |
9 | 328074641786 |
10 | 104252100000 |
11 | 40238657834 |
12 | 18255998480 |
13 | 9aa572a649 |
14 | 508da79b56 |
15 | 2aa26ab1a0 |
hex | 1845e8cda0 |
104252100000 has 576 divisors, whose sum is σ = 369943822080. Its totient is φ = 25625600000.
The previous prime is 104252099923. The next prime is 104252100011. The reversal of 104252100000 is 1252401.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 200099740 + ... + 200100260.
It is an arithmetic number, because the mean of its divisors is an integer number (642263580).
Almost surely, 2104252100000 is an apocalyptic number.
104252100000 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 104252100000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (184971911040).
104252100000 is an abundant number, since it is smaller than the sum of its proper divisors (265691722080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104252100000 is an equidigital number, since it uses as much as digits as its factorization.
104252100000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 611 (or 583 counting only the distinct ones).
The product of its (nonzero) digits is 80, while the sum is 15.
Adding to 104252100000 its reverse (1252401), we get a palindrome (104253352401).
The spelling of 104252100000 in words is "one hundred four billion, two hundred fifty-two million, one hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •