Base | Representation |
---|---|
bin | 110010101010… |
… | …1011001101000 |
3 | 1211222121020021 |
4 | 1211111121220 |
5 | 23300023300 |
6 | 2345210224 |
7 | 441535435 |
oct | 145253150 |
9 | 54877207 |
10 | 26564200 |
11 | 13aa4093 |
12 | 8a90974 |
13 | 5671180 |
14 | 3756b8c |
15 | 24ead1a |
hex | 1955668 |
26564200 has 96 divisors (see below), whose sum is σ = 70542360. Its totient is φ = 9216000.
The previous prime is 26564191. The next prime is 26564207. The reversal of 26564200 is 246562.
It can be written as a sum of positive squares in 12 ways, for example, as 3849444 + 22714756 = 1962^2 + 4766^2 .
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26564207) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 43900 + ... + 44500.
Almost surely, 226564200 is an apocalyptic number.
26564200 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 26564200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (35271180).
26564200 is an abundant number, since it is smaller than the sum of its proper divisors (43978160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26564200 is a wasteful number, since it uses less digits than its factorization.
26564200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 647 (or 638 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 25.
The square root of 26564200 is about 5154.0469536084. The cubic root of 26564200 is about 298.3771630897.
The spelling of 26564200 in words is "twenty-six million, five hundred sixty-four thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •