Base | Representation |
---|---|
bin | 110010011010… |
… | …0101001011000 |
3 | 1211201210012101 |
4 | 1210310221120 |
5 | 23231230130 |
6 | 2342253144 |
7 | 440436340 |
oct | 144645130 |
9 | 54653171 |
10 | 26430040 |
11 | 13a1230a |
12 | 8a271b4 |
13 | 56250a0 |
14 | 371dd20 |
15 | 24c11ca |
hex | 1934a58 |
26430040 has 128 divisors (see below), whose sum is σ = 75116160. Its totient is φ = 8146944.
The previous prime is 26430031. The next prime is 26430043. The reversal of 26430040 is 4003462.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26430043) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 192852 + ... + 192988.
It is an arithmetic number, because the mean of its divisors is an integer number (586845).
Almost surely, 226430040 is an apocalyptic number.
26430040 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 26430040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (37558080).
26430040 is an abundant number, since it is smaller than the sum of its proper divisors (48686120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26430040 is a wasteful number, since it uses less digits than its factorization.
26430040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 221 (or 217 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 19.
The square root of 26430040 is about 5141.0154638943. The cubic root of 26430040 is about 297.8740064648.
The spelling of 26430040 in words is "twenty-six million, four hundred thirty thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •