Base | Representation |
---|---|
bin | 11001001111111001… |
… | …001111001010000011 |
3 | 2120222100122021011122 |
4 | 121033321033022003 |
5 | 421010203130011 |
6 | 20242041502455 |
7 | 1646546652446 |
oct | 311771171203 |
9 | 76870567148 |
10 | 27110208131 |
11 | 10552007696 |
12 | 53071a1a2b |
13 | 2730789896 |
14 | 145272d65d |
15 | a8a0a43db |
hex | 64fe4f283 |
27110208131 has 2 divisors, whose sum is σ = 27110208132. Its totient is φ = 27110208130.
The previous prime is 27110208109. The next prime is 27110208163. The reversal of 27110208131 is 13180201172.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 27110208131 - 218 = 27109945987 is a prime.
It is a super-2 number, since 2×271102081312 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 27110208131.
It is not a weakly prime, because it can be changed into another prime (27110268131) 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, 13555104065 + 13555104066.
It is an arithmetic number, because the mean of its divisors is an integer number (13555104066).
Almost surely, 227110208131 is an apocalyptic number.
27110208131 is a deficient number, since it is larger than the sum of its proper divisors (1).
27110208131 is an equidigital number, since it uses as much as digits as its factorization.
27110208131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 672, while the sum is 26.
The spelling of 27110208131 in words is "twenty-seven billion, one hundred ten million, two hundred eight thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •