Base | Representation |
---|---|
bin | 11001110101011101… |
… | …110010001000000101 |
3 | 2122121021201201112122 |
4 | 121311131302020011 |
5 | 423303034424131 |
6 | 20424400055325 |
7 | 2001302514032 |
oct | 316535621005 |
9 | 78537651478 |
10 | 27740545541 |
11 | 108458a64a5 |
12 | 5462304545 |
13 | 2801247bb7 |
14 | 14b2332389 |
15 | ac55b5d7b |
hex | 675772205 |
27740545541 has 2 divisors, whose sum is σ = 27740545542. Its totient is φ = 27740545540.
The previous prime is 27740545513. The next prime is 27740545543. The reversal of 27740545541 is 14554504772.
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., 16824684100 + 10915861441 = 129710^2 + 104479^2 .
It is a cyclic number.
It is not a de Polignac number, because 27740545541 - 26 = 27740545477 is a prime.
Together with 27740545543, 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 = 27740545492 and 27740545501.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (27740545543) 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, 13870272770 + 13870272771.
It is an arithmetic number, because the mean of its divisors is an integer number (13870272771).
Almost surely, 227740545541 is an apocalyptic number.
It is an amenable number.
27740545541 is a deficient number, since it is larger than the sum of its proper divisors (1).
27740545541 is an equidigital number, since it uses as much as digits as its factorization.
27740545541 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 784000, while the sum is 44.
The spelling of 27740545541 in words is "twenty-seven billion, seven hundred forty million, five hundred forty-five thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •