Base | Representation |
---|---|
bin | 1100010110011110010011… |
… | …01011011011011001110001 |
3 | 10120011111220021122101111012 |
4 | 12023033021223123121301 |
5 | 12024444111211124312 |
6 | 133433202141200305 |
7 | 5502164364153653 |
oct | 613171153333161 |
9 | 116144807571435 |
10 | 27160461817457 |
11 | 8721761695861 |
12 | 3067a67860095 |
13 | 12202b3752837 |
14 | 69c8054606d3 |
15 | 32178c847322 |
hex | 18b3c9adb671 |
27160461817457 has 2 divisors, whose sum is σ = 27160461817458. Its totient is φ = 27160461817456.
The previous prime is 27160461817361. The next prime is 27160461817477. The reversal of 27160461817457 is 75471816406172.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 25215653067361 + 1944808750096 = 5021519^2 + 1394564^2 .
It is a cyclic number.
It is not a de Polignac number, because 27160461817457 - 218 = 27160461555313 is a prime.
It is a super-2 number, since 2×271604618174572 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 27160461817396 and 27160461817405.
It is not a weakly prime, because it can be changed into another prime (27160461817477) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 13580230908728 + 13580230908729.
It is an arithmetic number, because the mean of its divisors is an integer number (13580230908729).
Almost surely, 227160461817457 is an apocalyptic number.
It is an amenable number.
27160461817457 is a deficient number, since it is larger than the sum of its proper divisors (1).
27160461817457 is an equidigital number, since it uses as much as digits as its factorization.
27160461817457 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15805440, while the sum is 59.
The spelling of 27160461817457 in words is "twenty-seven trillion, one hundred sixty billion, four hundred sixty-one million, eight hundred seventeen thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •