Base | Representation |
---|---|
bin | 11000101101001010… |
… | …111111100110011000 |
3 | 2112110202110202222020 |
4 | 120231022333212120 |
5 | 413312040113230 |
6 | 20104151454440 |
7 | 1626244251621 |
oct | 305512774630 |
9 | 75422422866 |
10 | 26527660440 |
11 | 10283199a16 |
12 | 5184087420 |
13 | 2669b918c8 |
14 | 13d920aa48 |
15 | a53d82810 |
hex | 62d2bf998 |
26527660440 has 32 divisors (see below), whose sum is σ = 79582981680. Its totient is φ = 7074042752.
The previous prime is 26527660381. The next prime is 26527660447. The reversal of 26527660440 is 4406672562.
It is a hoax number, since the sum of its digits (42) coincides with the sum of the digits of its distinct prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 26527660392 and 26527660401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26527660447) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 110531799 + ... + 110532038.
Almost surely, 226527660440 is an apocalyptic number.
26527660440 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
26527660440 is an abundant number, since it is smaller than the sum of its proper divisors (53055321240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26527660440 is a wasteful number, since it uses less digits than its factorization.
26527660440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 221063851 (or 221063847 counting only the distinct ones).
The product of its (nonzero) digits is 483840, while the sum is 42.
The spelling of 26527660440 in words is "twenty-six billion, five hundred twenty-seven million, six hundred sixty thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •