Base | Representation |
---|---|
bin | 110000101100010100… |
… | …1100011111000101000 |
3 | 100222220102022211110112 |
4 | 1201120221203320220 |
5 | 3203123011130000 |
6 | 120012011033452 |
7 | 10361153425106 |
oct | 1413051437050 |
9 | 328812284415 |
10 | 104566505000 |
11 | 4038a07a981 |
12 | 1832313b888 |
13 | 9b258cccc9 |
14 | 50bd71cc76 |
15 | 2ac00b3235 |
hex | 1858a63e28 |
104566505000 has 80 divisors (see below), whose sum is σ = 249016429860. Its totient is φ = 41140800000.
The previous prime is 104566504873. The next prime is 104566505003. The reversal of 104566505000 is 505665401.
It can be written as a sum of positive squares in 10 ways, for example, as 23116769764 + 81449735236 = 152042^2 + 285394^2 .
It is not an unprimeable number, because it can be changed into a prime (104566505003) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 133580 + ... + 476420.
Almost surely, 2104566505000 is an apocalyptic number.
104566505000 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 104566505000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (124508214930).
104566505000 is an abundant number, since it is smaller than the sum of its proper divisors (144449924860).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104566505000 is an equidigital number, since it uses as much as digits as its factorization.
104566505000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 342928 (or 342909 counting only the distinct ones).
The product of its (nonzero) digits is 18000, while the sum is 32.
The spelling of 104566505000 in words is "one hundred four billion, five hundred sixty-six million, five hundred five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •