Base | Representation |
---|---|
bin | 11000100101110111… |
… | …010010111001101000 |
3 | 2112011012202211102220 |
4 | 120211313102321220 |
5 | 413034143243404 |
6 | 20044051554040 |
7 | 1623225162600 |
oct | 304567227150 |
9 | 75135684386 |
10 | 26405056104 |
11 | 1021aa69519 |
12 | 514abbb920 |
13 | 264a66546b |
14 | 13c6c13c00 |
15 | a482154d9 |
hex | 625dd2e68 |
26405056104 has 192 divisors, whose sum is σ = 80220067200. Its totient is φ = 7212473856.
The previous prime is 26405056103. The next prime is 26405056121. The reversal of 26405056104 is 40165050462.
It is a super-3 number, since 3×264050561043 (a number of 32 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (26405056103) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3508954 + ... + 3516470.
It is an arithmetic number, because the mean of its divisors is an integer number (417812850).
Almost surely, 226405056104 is an apocalyptic number.
26405056104 is a gapful number since it is divisible by the number (24) 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 26405056104, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (40110033600).
26405056104 is an abundant number, since it is smaller than the sum of its proper divisors (53815011096).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26405056104 is a wasteful number, since it uses less digits than its factorization.
26405056104 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7672 (or 7661 counting only the distinct ones).
The product of its (nonzero) digits is 28800, while the sum is 33.
The spelling of 26405056104 in words is "twenty-six billion, four hundred five million, fifty-six thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •