Base | Representation |
---|---|
bin | 11000110011001011… |
… | …101011010100010000 |
3 | 2112201210020002200110 |
4 | 120303023223110100 |
5 | 414013344042200 |
6 | 20122153121320 |
7 | 1631610352644 |
oct | 306313532420 |
9 | 75653202613 |
10 | 26628502800 |
11 | 10325106309 |
12 | 51b19b9240 |
13 | 2684a3b943 |
14 | 140877ac24 |
15 | a5cb51b50 |
hex | 6332eb510 |
26628502800 has 120 divisors (see below), whose sum is σ = 85771940800. Its totient is φ = 7061644800.
The previous prime is 26628502753. The next prime is 26628502807. The reversal of 26628502800 is 820582662.
It is a tau number, because it is divible by the number of its divisors (120).
It is a super-2 number, since 2×266285028002 (a number of 22 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (26628502807) 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, 155901 + ... + 278499.
Almost surely, 226628502800 is an apocalyptic number.
26628502800 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 26628502800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (42885970400).
26628502800 is an abundant number, since it is smaller than the sum of its proper divisors (59143438000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26628502800 is a wasteful number, since it uses less digits than its factorization.
26628502800 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 122801 (or 122790 counting only the distinct ones).
The product of its (nonzero) digits is 92160, while the sum is 39.
The spelling of 26628502800 in words is "twenty-six billion, six hundred twenty-eight million, five hundred two thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •