Base | Representation |
---|---|
bin | 110101000100… |
… | …0000001011111 |
3 | 1221100102001002 |
4 | 1222020001133 |
5 | 24110221002 |
6 | 2432140515 |
7 | 455316146 |
oct | 152100137 |
9 | 57312032 |
10 | 27820127 |
11 | 14781745 |
12 | 939773b |
13 | 59c0a1a |
14 | 39a275d |
15 | 2698002 |
hex | 1a8805f |
27820127 has 2 divisors, whose sum is σ = 27820128. Its totient is φ = 27820126.
The previous prime is 27820103. The next prime is 27820141. The reversal of 27820127 is 72102872.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 27820127 - 26 = 27820063 is a prime.
It is a super-2 number, since 2×278201272 = 1547918932592258, which contains 22 as substring.
It is a Chen prime.
It is equal to p1730954 and since 27820127 and 1730954 have the same sum of digits, it is a Honaker prime.
It is a self number, because there is not a number n which added to its sum of digits gives 27820127.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (27820157) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 13910063 + 13910064.
It is an arithmetic number, because the mean of its divisors is an integer number (13910064).
Almost surely, 227820127 is an apocalyptic number.
27820127 is a deficient number, since it is larger than the sum of its proper divisors (1).
27820127 is an equidigital number, since it uses as much as digits as its factorization.
27820127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3136, while the sum is 29.
The square root of 27820127 is about 5274.4788368141. The cubic root of 27820127 is about 303.0072612782.
Adding to 27820127 its reverse (72102872), we get a palindrome (99922999).
The spelling of 27820127 in words is "twenty-seven million, eight hundred twenty thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •