Base | Representation |
---|---|
bin | 11001011111011110… |
… | …100101011110110101 |
3 | 2121122120121020210022 |
4 | 121133132211132311 |
5 | 422024121012031 |
6 | 20324021334525 |
7 | 1656203150453 |
oct | 313736453665 |
9 | 77576536708 |
10 | 27371657141 |
11 | 10676650154 |
12 | 537a867445 |
13 | 27729aa53a |
14 | 14793499d3 |
15 | aa2eea97b |
hex | 65f7a57b5 |
27371657141 has 2 divisors, whose sum is σ = 27371657142. Its totient is φ = 27371657140.
The previous prime is 27371657077. The next prime is 27371657147. The reversal of 27371657141 is 14175617372.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 25680062500 + 1691594641 = 160250^2 + 41129^2 .
It is a cyclic number.
It is not a de Polignac number, because 27371657141 - 26 = 27371657077 is a prime.
It is a super-2 number, since 2×273716571412 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 27371657092 and 27371657101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (27371657147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 13685828570 + 13685828571.
It is an arithmetic number, because the mean of its divisors is an integer number (13685828571).
Almost surely, 227371657141 is an apocalyptic number.
It is an amenable number.
27371657141 is a deficient number, since it is larger than the sum of its proper divisors (1).
27371657141 is an equidigital number, since it uses as much as digits as its factorization.
27371657141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 246960, while the sum is 44.
The spelling of 27371657141 in words is "twenty-seven billion, three hundred seventy-one million, six hundred fifty-seven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •