Base | Representation |
---|---|
bin | 110100000110… |
… | …0110011000101 |
3 | 1220101202200101 |
4 | 1220030303011 |
5 | 23443043042 |
6 | 2413244101 |
7 | 451114504 |
oct | 150146305 |
9 | 56352611 |
10 | 27315397 |
11 | 1446750a |
12 | 9193631 |
13 | 5875075 |
14 | 38b083b |
15 | 25e86b7 |
hex | 1a0ccc5 |
27315397 has 2 divisors, whose sum is σ = 27315398. Its totient is φ = 27315396.
The previous prime is 27315391. The next prime is 27315401. The reversal of 27315397 is 79351372.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 25948836 + 1366561 = 5094^2 + 1169^2 .
It is a cyclic number.
It is not a de Polignac number, because 27315397 - 27 = 27315269 is a prime.
It is a super-2 number, since 2×273153972 = 1492261826535218, which contains 22 as substring.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (27315391) 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, 13657698 + 13657699.
It is an arithmetic number, because the mean of its divisors is an integer number (13657699).
Almost surely, 227315397 is an apocalyptic number.
It is an amenable number.
27315397 is a deficient number, since it is larger than the sum of its proper divisors (1).
27315397 is an equidigital number, since it uses as much as digits as its factorization.
27315397 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 39690, while the sum is 37.
The square root of 27315397 is about 5226.4133973500. The cubic root of 27315397 is about 301.1636178467.
It can be divided in two parts, 2731 and 5397, that added together give a triangular number (8128 = T127).
The spelling of 27315397 in words is "twenty-seven million, three hundred fifteen thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •