Base | Representation |
---|---|
bin | 11000111101011110… |
… | …110001010000000000 |
3 | 2120011211100002110000 |
4 | 120331132301100000 |
5 | 414342111430000 |
6 | 20151244240000 |
7 | 1636106056365 |
oct | 307536612000 |
9 | 76154302400 |
10 | 26801280000 |
11 | 10403695390 |
12 | 523b840000 |
13 | 26b1784081 |
14 | 14236b446c |
15 | a6cdd0000 |
hex | 63d7b1400 |
26801280000 has 1100 divisors, whose sum is σ = 111423483072. Its totient is φ = 6359040000.
The previous prime is 26801279993. The next prime is 26801280013. The reversal of 26801280000 is 8210862.
It is a tau number, because it is divible by the number of its divisors (1100).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 99 ways as a sum of consecutive naturals, for example, 570239977 + ... + 570240023.
Almost surely, 226801280000 is an apocalyptic number.
26801280000 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 26801280000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (55711741536).
26801280000 is an abundant number, since it is smaller than the sum of its proper divisors (84622203072).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26801280000 is an equidigital number, since it uses as much as digits as its factorization.
26801280000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110 (or 68 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 27.
Adding to 26801280000 its reverse (8210862), we get a palindrome (26809490862).
The spelling of 26801280000 in words is "twenty-six billion, eight hundred one million, two hundred eighty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •