Base | Representation |
---|---|
bin | 110001110010… |
… | …1000011000000 |
3 | 1211010012221211 |
4 | 1203211003000 |
5 | 23140312000 |
6 | 2331255504 |
7 | 434610646 |
oct | 143450300 |
9 | 54105854 |
10 | 26104000 |
11 | 1380a35a |
12 | 88aa594 |
13 | 553c870 |
14 | 3677196 |
15 | 24597ba |
hex | 18e50c0 |
26104000 has 112 divisors (see below), whose sum is σ = 69896736. Its totient is φ = 9600000.
The previous prime is 26103991. The next prime is 26104007. The reversal of 26104000 is 40162.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is not an unprimeable number, because it can be changed into a prime (26104007) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 103875 + ... + 104125.
It is an arithmetic number, because the mean of its divisors is an integer number (624078).
Almost surely, 226104000 is an apocalyptic number.
26104000 is a gapful number since it is divisible by the number (20) 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 26104000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (34948368).
26104000 is an abundant number, since it is smaller than the sum of its proper divisors (43792736).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26104000 is a wasteful number, since it uses less digits than its factorization.
26104000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 291 (or 271 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 13.
The square root of 26104000 is about 5109.2073749262. The cubic root of 26104000 is about 296.6440808178.
Adding to 26104000 its reverse (40162), we get a palindrome (26144162).
The spelling of 26104000 in words is "twenty-six million, one hundred four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •