Base | Representation |
---|---|
bin | 11000100101110000… |
… | …000001010000000000 |
3 | 2112011002011221010000 |
4 | 120211300001100000 |
5 | 413033201230200 |
6 | 20043543040000 |
7 | 1623203030130 |
oct | 304560012000 |
9 | 75132157100 |
10 | 26403148800 |
11 | 10219986536 |
12 | 514a440000 |
13 | 264a148292 |
14 | 13c6878ac0 |
15 | a47e8a300 |
hex | 625c01400 |
26403148800 has 1320 divisors, whose sum is σ = 119412874944. Its totient is φ = 5626920960.
The previous prime is 26403148789. The next prime is 26403148813. The reversal of 26403148800 is 884130462.
26403148800 is a `hidden beast` number, since 2 + 640 + 3 + 1 + 4 + 8 + 8 + 0 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 119 ways as a sum of consecutive naturals, for example, 246758347 + ... + 246758453.
Almost surely, 226403148800 is an apocalyptic number.
26403148800 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 26403148800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (59706437472).
26403148800 is an abundant number, since it is smaller than the sum of its proper divisors (93009726144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26403148800 is a wasteful number, since it uses less digits than its factorization.
26403148800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 173 (or 141 counting only the distinct ones).
The product of its (nonzero) digits is 36864, while the sum is 36.
The spelling of 26403148800 in words is "twenty-six billion, four hundred three million, one hundred forty-eight thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •