Base | Representation |
---|---|
bin | 11001001101100101… |
… | …110001000110011001 |
3 | 2120212122220012222102 |
4 | 121031211301012121 |
5 | 420420304043344 |
6 | 20234141133145 |
7 | 1645600243211 |
oct | 311545610631 |
9 | 76778805872 |
10 | 27071549849 |
11 | 105322030a3 |
12 | 52b625a1b5 |
13 | 2725772966 |
14 | 144b549241 |
15 | a869b9e4e |
hex | 64d971199 |
27071549849 has 2 divisors, whose sum is σ = 27071549850. Its totient is φ = 27071549848.
The previous prime is 27071549801. The next prime is 27071549867. The reversal of 27071549849 is 94894517072.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 23212655449 + 3858894400 = 152357^2 + 62120^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-27071549849 is a prime.
It is a super-2 number, since 2×270715498492 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 27071549794 and 27071549803.
It is not a weakly prime, because it can be changed into another prime (27071549899) 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 as a sum of consecutive naturals, namely, 13535774924 + 13535774925.
It is an arithmetic number, because the mean of its divisors is an integer number (13535774925).
Almost surely, 227071549849 is an apocalyptic number.
It is an amenable number.
27071549849 is a deficient number, since it is larger than the sum of its proper divisors (1).
27071549849 is an equidigital number, since it uses as much as digits as its factorization.
27071549849 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5080320, while the sum is 56.
The spelling of 27071549849 in words is "twenty-seven billion, seventy-one million, five hundred forty-nine thousand, eight hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •