Base | Representation |
---|---|
bin | 11001000011111001… |
… | …011000110100000000 |
3 | 2120110022212211020222 |
4 | 121003321120310000 |
5 | 420102140433323 |
6 | 20210051322212 |
7 | 1641554024660 |
oct | 310371306400 |
9 | 76408784228 |
10 | 26908921088 |
11 | 10459425765 |
12 | 526b8b0368 |
13 | 26cab7181a |
14 | 1433ad41a0 |
15 | a775939c8 |
hex | 643e58d00 |
26908921088 has 72 divisors (see below), whose sum is σ = 61754243712. Its totient is φ = 11463211008.
The previous prime is 26908921079. The next prime is 26908921097. The reversal of 26908921088 is 88012980962.
It is an interprime number because it is at equal distance from previous prime (26908921079) and next prime (26908921097).
It is a super-2 number, since 2×269089210882 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 254306 + ... + 344222.
Almost surely, 226908921088 is an apocalyptic number.
26908921088 is a gapful number since it is divisible by the number (28) 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 26908921088, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (30877121856).
26908921088 is an abundant number, since it is smaller than the sum of its proper divisors (34845322624).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26908921088 is an equidigital number, since it uses as much as digits as its factorization.
26908921088 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 90107 (or 90093 counting only the distinct ones).
The product of its (nonzero) digits is 995328, while the sum is 53.
The spelling of 26908921088 in words is "twenty-six billion, nine hundred eight million, nine hundred twenty-one thousand, eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •