Base | Representation |
---|---|
bin | 110001100111… |
… | …1011011010000 |
3 | 1210221201110211 |
4 | 1203033123100 |
5 | 23124443230 |
6 | 2325333504 |
7 | 434061523 |
oct | 143173320 |
9 | 53851424 |
10 | 26015440 |
11 | 13759870 |
12 | 8867294 |
13 | 550b469 |
14 | 3652bba |
15 | 243d42a |
hex | 18cf6d0 |
26015440 has 160 divisors (see below), whose sum is σ = 73281024. Its totient is φ = 8478720.
The previous prime is 26015419. The next prime is 26015441. The reversal of 26015440 is 4451062.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26015441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 553497 + ... + 553543.
Almost surely, 226015440 is an apocalyptic number.
26015440 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 26015440, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (36640512).
26015440 is an abundant number, since it is smaller than the sum of its proper divisors (47265584).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26015440 is a wasteful number, since it uses less digits than its factorization.
26015440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 125 (or 119 counting only the distinct ones).
The product of its (nonzero) digits is 960, while the sum is 22.
The square root of 26015440 is about 5100.5333054495. The cubic root of 26015440 is about 296.3082374663.
The spelling of 26015440 in words is "twenty-six million, fifteen thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •