Base | Representation |
---|---|
bin | 11001001000001010… |
… | …101011101000000000 |
3 | 2120122022200122010000 |
4 | 121020022223220000 |
5 | 420224011012311 |
6 | 20221131040000 |
7 | 1643414001600 |
oct | 311012535000 |
9 | 76568618100 |
10 | 26980563456 |
11 | 10495908730 |
12 | 528b8a0000 |
13 | 270c966a62 |
14 | 143d422c00 |
15 | a7d9e6056 |
hex | 6482aba00 |
26980563456 has 1200 divisors, whose sum is σ = 109729173312. Its totient is φ = 6502809600.
The previous prime is 26980563451. The next prime is 26980563461. The reversal of 26980563456 is 65436508962.
26980563456 is a `hidden beast` number, since 2 + 69 + 80 + 56 + 3 + 456 = 666.
It is an interprime number because it is at equal distance from previous prime (26980563451) and next prime (26980563461).
It is a Harshad number since it is a multiple of its sum of digits (54).
It is not an unprimeable number, because it can be changed into a prime (26980563451) by changing a digit.
It is a polite number, since it can be written in 119 ways as a sum of consecutive naturals, for example, 380007901 + ... + 380007971.
Almost surely, 226980563456 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 26980563456, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (54864586656).
26980563456 is an abundant number, since it is smaller than the sum of its proper divisors (82748609856).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26980563456 is a wasteful number, since it uses less digits than its factorization.
26980563456 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 143 (or 111 counting only the distinct ones).
The product of its (nonzero) digits is 9331200, while the sum is 54.
The spelling of 26980563456 in words is "twenty-six billion, nine hundred eighty million, five hundred sixty-three thousand, four hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •