Base | Representation |
---|---|
bin | 110011110011… |
… | …0111000111111 |
3 | 1220002212200122 |
4 | 1213212320333 |
5 | 23423111002 |
6 | 2410045155 |
7 | 446600021 |
oct | 147467077 |
9 | 56085618 |
10 | 27160127 |
11 | 14370895 |
12 | 91197bb |
13 | 581c4a7 |
14 | 3870011 |
15 | 25b76a2 |
hex | 19e6e3f |
27160127 has 8 divisors (see below), whose sum is σ = 27662112. Its totient is φ = 26661600.
The previous prime is 27160103. The next prime is 27160141. The reversal of 27160127 is 72106172.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 27160127 - 210 = 27159103 is a prime.
It is a super-2 number, since 2×271601272 = 1475344997312258, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 27160096 and 27160105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (27160027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18977 + ... + 20357.
It is an arithmetic number, because the mean of its divisors is an integer number (3457764).
Almost surely, 227160127 is an apocalyptic number.
27160127 is a deficient number, since it is larger than the sum of its proper divisors (501985).
27160127 is a wasteful number, since it uses less digits than its factorization.
27160127 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1729.
The product of its (nonzero) digits is 1176, while the sum is 26.
The square root of 27160127 is about 5211.5378728356. The cubic root of 27160127 is about 300.5918943984.
Adding to 27160127 its reverse (72106172), we get a palindrome (99266299).
The spelling of 27160127 in words is "twenty-seven million, one hundred sixty thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •