Base | Representation |
---|---|
bin | 11001111001011111… |
… | …100000100111000011 |
3 | 2122202222212012100221 |
4 | 121321133200213003 |
5 | 423422333410242 |
6 | 20435212123511 |
7 | 2003053003045 |
oct | 317137404703 |
9 | 78688765327 |
10 | 27808106947 |
11 | 1087aa51375 |
12 | 5480a66597 |
13 | 281224176a |
14 | 14bb2bba95 |
15 | acb4ae167 |
hex | 6797e09c3 |
27808106947 has 2 divisors, whose sum is σ = 27808106948. Its totient is φ = 27808106946.
The previous prime is 27808106863. The next prime is 27808106959. The reversal of 27808106947 is 74960180872.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 27808106947 - 27 = 27808106819 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 27808106894 and 27808106903.
It is not a weakly prime, because it can be changed into another prime (27800106947) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 13904053473 + 13904053474.
It is an arithmetic number, because the mean of its divisors is an integer number (13904053474).
Almost surely, 227808106947 is an apocalyptic number.
27808106947 is a deficient number, since it is larger than the sum of its proper divisors (1).
27808106947 is an equidigital number, since it uses as much as digits as its factorization.
27808106947 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1354752, while the sum is 52.
The spelling of 27808106947 in words is "twenty-seven billion, eight hundred eight million, one hundred six thousand, nine hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •