Base | Representation |
---|---|
bin | 110011101000… |
… | …1111100010001 |
3 | 1212221111222122 |
4 | 1213101330101 |
5 | 23412334241 |
6 | 2404144025 |
7 | 446061611 |
oct | 147217421 |
9 | 55844878 |
10 | 27074321 |
11 | 1431237a |
12 | 9098015 |
13 | 57bc411 |
14 | 384aa41 |
15 | 259c04b |
hex | 19d1f11 |
27074321 has 2 divisors, whose sum is σ = 27074322. Its totient is φ = 27074320.
The previous prime is 27074293. The next prime is 27074323. The reversal of 27074321 is 12347072.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 26884225 + 190096 = 5185^2 + 436^2 .
It is a cyclic number.
It is not a de Polignac number, because 27074321 - 210 = 27073297 is a prime.
It is a super-2 number, since 2×270743212 = 1466037715222082, which contains 22 as substring.
It is a Sophie Germain prime.
Together with 27074323, it forms a pair of twin primes.
It is a Chen prime.
It is an alternating number because its digits alternate between even and odd.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (27074323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 13537160 + 13537161.
It is an arithmetic number, because the mean of its divisors is an integer number (13537161).
Almost surely, 227074321 is an apocalyptic number.
It is an amenable number.
27074321 is a deficient number, since it is larger than the sum of its proper divisors (1).
27074321 is an equidigital number, since it uses as much as digits as its factorization.
27074321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2352, while the sum is 26.
The square root of 27074321 is about 5203.2990496415. The cubic root of 27074321 is about 300.2750107828.
The spelling of 27074321 in words is "twenty-seven million, seventy-four thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •