Base | Representation |
---|---|
bin | 11001000101000100… |
… | …110111101000110011 |
3 | 2120111201010010000000 |
4 | 121011010313220303 |
5 | 420122222130042 |
6 | 20212035401043 |
7 | 1642214146125 |
oct | 310504675063 |
9 | 76451103000 |
10 | 26928708147 |
11 | 10469610000 |
12 | 5276453183 |
13 | 2701cac043 |
14 | 14365a5215 |
15 | a791a174c |
hex | 645137a33 |
26928708147 has 120 divisors (see below), whose sum is σ = 46010052400. Its totient is φ = 15757655760.
The previous prime is 26928708143. The next prime is 26928708199. The reversal of 26928708147 is 74180782962.
It is a happy number.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It is not a de Polignac number, because 26928708147 - 22 = 26928708143 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 26928708093 and 26928708102.
It is not an unprimeable number, because it can be changed into a prime (26928708143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 119 ways as a sum of consecutive naturals, for example, 928576129 + ... + 928576157.
Almost surely, 226928708147 is an apocalyptic number.
26928708147 is a gapful number since it is divisible by the number (27) formed by its first and last digit.
26928708147 is a deficient number, since it is larger than the sum of its proper divisors (19081344253).
26928708147 is an frugal number, since it uses more digits than its factorization.
26928708147 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 123 (or 43 counting only the distinct ones).
The product of its (nonzero) digits is 2709504, while the sum is 54.
The spelling of 26928708147 in words is "twenty-six billion, nine hundred twenty-eight million, seven hundred eight thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •