Base | Representation |
---|---|
bin | 110011100011… |
… | …1001001101001 |
3 | 1212212021100121 |
4 | 1213013021221 |
5 | 23404430441 |
6 | 2403203241 |
7 | 445516006 |
oct | 147071151 |
9 | 55767317 |
10 | 27030121 |
11 | 14292148 |
12 | 9076521 |
13 | 57a5271 |
14 | 38388ad |
15 | 258ddd1 |
hex | 19c7269 |
27030121 has 2 divisors, whose sum is σ = 27030122. Its totient is φ = 27030120.
The previous prime is 27030089. The next prime is 27030131. The reversal of 27030121 is 12103072.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14356521 + 12673600 = 3789^2 + 3560^2 .
It is a cyclic number.
It is not a de Polignac number, because 27030121 - 25 = 27030089 is a prime.
It is an alternating number because its digits alternate between even and odd.
It is a junction number, because it is equal to n+sod(n) for n = 27030095 and 27030104.
It is not a weakly prime, because it can be changed into another prime (27030131) 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, 13515060 + 13515061.
It is an arithmetic number, because the mean of its divisors is an integer number (13515061).
Almost surely, 227030121 is an apocalyptic number.
It is an amenable number.
27030121 is a deficient number, since it is larger than the sum of its proper divisors (1).
27030121 is an equidigital number, since it uses as much as digits as its factorization.
27030121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 84, while the sum is 16.
The square root of 27030121 is about 5199.0500093767. The cubic root of 27030121 is about 300.1115178001. Note that the first 3 decimals are identical.
Adding to 27030121 its reverse (12103072), we get a palindrome (39133193).
The spelling of 27030121 in words is "twenty-seven million, thirty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.251 sec. • engine limits •