Base | Representation |
---|---|
bin | 1100001000000000010010… |
… | …10011000000000011101000 |
3 | 10111101222200010100012010000 |
4 | 12010000021103000003220 |
5 | 11443322431103340410 |
6 | 132412542403423000 |
7 | 5421234515413464 |
oct | 604001123000350 |
9 | 114358603305100 |
10 | 26663312949480 |
11 | 854a93605a019 |
12 | 2ba7641684a60 |
13 | 11b54551c573c |
14 | 682722b714a4 |
15 | 31389219ddc0 |
hex | 1840094c00e8 |
26663312949480 has 320 divisors, whose sum is σ = 92183658336000. Its totient is φ = 6908865808896.
The previous prime is 26663312949451. The next prime is 26663312949499. The reversal of 26663312949480 is 8494921336662.
It is an unprimeable number.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 20537086 + ... + 21796754.
It is an arithmetic number, because the mean of its divisors is an integer number (288073932300).
Almost surely, 226663312949480 is an apocalyptic number.
26663312949480 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 26663312949480, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (46091829168000).
26663312949480 is an abundant number, since it is smaller than the sum of its proper divisors (65520345386520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26663312949480 is a wasteful number, since it uses less digits than its factorization.
26663312949480 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1259878 (or 1259865 counting only the distinct ones).
The product of its (nonzero) digits is 80621568, while the sum is 63.
The spelling of 26663312949480 in words is "twenty-six trillion, six hundred sixty-three billion, three hundred twelve million, nine hundred forty-nine thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •