Base | Representation |
---|---|
bin | 110011001001… |
… | …0010010100000 |
3 | 1212110021100022 |
4 | 1212102102200 |
5 | 23331013400 |
6 | 2354413012 |
7 | 443624522 |
oct | 146222240 |
9 | 55407308 |
10 | 26813600 |
11 | 14154500 |
12 | 8b91168 |
13 | 572a848 |
14 | 37bda12 |
15 | 2549b85 |
hex | 19924a0 |
26813600 has 108 divisors (see below), whose sum is σ = 72210222. Its totient is φ = 9715200.
The previous prime is 26813599. The next prime is 26813609. The reversal of 26813600 is 631862.
It can be written as a sum of positive squares in 3 ways, for example, as 15335056 + 11478544 = 3916^2 + 3388^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 26813600.
It is not an unprimeable number, because it can be changed into a prime (26813609) by changing a digit.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 96662 + ... + 96938.
Almost surely, 226813600 is an apocalyptic number.
26813600 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 26813600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (36105111).
26813600 is an abundant number, since it is smaller than the sum of its proper divisors (45396622).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26813600 is a wasteful number, since it uses less digits than its factorization.
26813600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 319 (or 295 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 26.
The square root of 26813600 is about 5178.1850102135. The cubic root of 26813600 is about 299.3080348040.
The spelling of 26813600 in words is "twenty-six million, eight hundred thirteen thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •