Base | Representation |
---|---|
bin | 110010010111… |
… | …1100000001010 |
3 | 1211200201022000 |
4 | 1210233200022 |
5 | 23230041340 |
6 | 2342011430 |
7 | 440321040 |
oct | 144574012 |
9 | 54621260 |
10 | 26408970 |
11 | 139a84a5 |
12 | 8a16b76 |
13 | 5618613 |
14 | 3716390 |
15 | 24b9d30 |
hex | 192f80a |
26408970 has 128 divisors (see below), whose sum is σ = 81907200. Its totient is φ = 5930496.
The previous prime is 26408959. The next prime is 26408981. The reversal of 26408970 is 7980462.
26408970 is a `hidden beast` number, since 2 + 640 + 8 + 9 + 7 + 0 = 666.
It is an interprime number because it is at equal distance from previous prime (26408959) and next prime (26408981).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 168132 + ... + 168288.
It is an arithmetic number, because the mean of its divisors is an integer number (639900).
Almost surely, 226408970 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 26408970, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (40953600).
26408970 is an abundant number, since it is smaller than the sum of its proper divisors (55498230).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26408970 is a wasteful number, since it uses less digits than its factorization.
26408970 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 269 (or 263 counting only the distinct ones).
The product of its (nonzero) digits is 24192, while the sum is 36.
The square root of 26408970 is about 5138.9658492736. The cubic root of 26408970 is about 297.7948304736.
The spelling of 26408970 in words is "twenty-six million, four hundred eight thousand, nine hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.011 sec. • engine limits •