Base | Representation |
---|---|
bin | 1100010101000000110010… |
… | …10011100010110011101001 |
3 | 10112222201022111112121210102 |
4 | 12022200121103202303221 |
5 | 12023133302040013212 |
6 | 133354140341555145 |
7 | 5465436316630511 |
oct | 612403123426351 |
9 | 115881274477712 |
10 | 27110258126057 |
11 | 8702439a49407 |
12 | 305a196715ab5 |
13 | 1218642735572 |
14 | 69a201a6a841 |
15 | 3203001695c2 |
hex | 18a8194e2ce9 |
27110258126057 has 2 divisors, whose sum is σ = 27110258126058. Its totient is φ = 27110258126056.
The previous prime is 27110258126047. The next prime is 27110258126059. The reversal of 27110258126057 is 75062185201172.
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., 25731838894336 + 1378419231721 = 5072656^2 + 1174061^2 .
It is a cyclic number.
It is not a de Polignac number, because 27110258126057 - 220 = 27110257077481 is a prime.
It is a super-2 number, since 2×271102581260572 (a number of 28 digits) contains 22 as substring.
Together with 27110258126059, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (27110258126059) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 13555129063028 + 13555129063029.
It is an arithmetic number, because the mean of its divisors is an integer number (13555129063029).
Almost surely, 227110258126057 is an apocalyptic number.
It is an amenable number.
27110258126057 is a deficient number, since it is larger than the sum of its proper divisors (1).
27110258126057 is an equidigital number, since it uses as much as digits as its factorization.
27110258126057 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 470400, while the sum is 47.
The spelling of 27110258126057 in words is "twenty-seven trillion, one hundred ten billion, two hundred fifty-eight million, one hundred twenty-six thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •