Base | Representation |
---|---|
bin | 110010001011… |
… | …1111011111000 |
3 | 1211111210212211 |
4 | 1210113323320 |
5 | 23213444230 |
6 | 2335544504 |
7 | 436436440 |
oct | 144277370 |
9 | 54453784 |
10 | 26312440 |
11 | 13941a20 |
12 | 898b134 |
13 | 55b36bb |
14 | 36cd120 |
15 | 249b42a |
hex | 1917ef8 |
26312440 has 64 divisors (see below), whose sum is σ = 73820160. Its totient is φ = 8200320.
The previous prime is 26312423. The next prime is 26312443. The reversal of 26312440 is 4421362.
It is a happy number.
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 (26312443) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1192 + ... + 7351.
It is an arithmetic number, because the mean of its divisors is an integer number (1153440).
Almost surely, 226312440 is an apocalyptic number.
26312440 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 26312440, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (36910080).
26312440 is an abundant number, since it is smaller than the sum of its proper divisors (47507720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26312440 is a wasteful number, since it uses less digits than its factorization.
26312440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8572 (or 8568 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 22.
The square root of 26312440 is about 5129.5652837253. The cubic root of 26312440 is about 297.4315545292.
The spelling of 26312440 in words is "twenty-six million, three hundred twelve thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.115 sec. • engine limits •