Base | Representation |
---|---|
bin | 11001010011110110… |
… | …001101000110011101 |
3 | 2121010222102100220002 |
4 | 121103312031012131 |
5 | 421124142202031 |
6 | 20252411104045 |
7 | 1651313424656 |
oct | 312366150635 |
9 | 77128370802 |
10 | 27176522141 |
11 | 1058649035a |
12 | 5325442025 |
13 | 2741437742 |
14 | 145b47252d |
15 | a90d02ccb |
hex | 653d8d19d |
27176522141 has 2 divisors, whose sum is σ = 27176522142. Its totient is φ = 27176522140.
The previous prime is 27176522081. The next prime is 27176522143. The reversal of 27176522141 is 14122567172.
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., 25978670041 + 1197852100 = 161179^2 + 34610^2 .
It is a cyclic number.
It is not a de Polignac number, because 27176522141 - 234 = 9996652957 is a prime.
Together with 27176522143, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 27176522095 and 27176522104.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (27176522143) 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, 13588261070 + 13588261071.
It is an arithmetic number, because the mean of its divisors is an integer number (13588261071).
Almost surely, 227176522141 is an apocalyptic number.
It is an amenable number.
27176522141 is a deficient number, since it is larger than the sum of its proper divisors (1).
27176522141 is an equidigital number, since it uses as much as digits as its factorization.
27176522141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 47040, while the sum is 38.
The spelling of 27176522141 in words is "twenty-seven billion, one hundred seventy-six million, five hundred twenty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •