Base | Representation |
---|---|
bin | 110010001101… |
… | …1101010000000 |
3 | 1211112120210021 |
4 | 1210123222000 |
5 | 23214441210 |
6 | 2340143224 |
7 | 436532041 |
oct | 144335200 |
9 | 54476707 |
10 | 26327680 |
11 | 13952415 |
12 | 8997b14 |
13 | 55ba612 |
14 | 36d48c8 |
15 | 24a0bda |
hex | 191ba80 |
26327680 has 64 divisors (see below), whose sum is σ = 65018880. Its totient is φ = 10183680.
The previous prime is 26327647. The next prime is 26327681. The reversal of 26327680 is 8672362.
It is a tau number, because it is divible by the number of its divisors (64).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26327681) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19177 + ... + 20503.
It is an arithmetic number, because the mean of its divisors is an integer number (1015920).
Almost surely, 226327680 is an apocalyptic number.
26327680 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 26327680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (32509440).
26327680 is an abundant number, since it is smaller than the sum of its proper divisors (38691200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26327680 is a wasteful number, since it uses less digits than its factorization.
26327680 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1377 (or 1365 counting only the distinct ones).
The product of its (nonzero) digits is 24192, while the sum is 34.
The square root of 26327680 is about 5131.0505746874. The cubic root of 26327680 is about 297.4889669425.
The spelling of 26327680 in words is "twenty-six million, three hundred twenty-seven thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •