Base | Representation |
---|---|
bin | 110100110110… |
… | …1101000010101 |
3 | 1221010220202011 |
4 | 1221231220111 |
5 | 24043241041 |
6 | 2425544221 |
7 | 454356031 |
oct | 151555025 |
9 | 57126664 |
10 | 27712021 |
11 | 147084a7 |
12 | 9345071 |
13 | 598375c |
14 | 39751c1 |
15 | 2675e81 |
hex | 1a6da15 |
27712021 has 2 divisors, whose sum is σ = 27712022. Its totient is φ = 27712020.
The previous prime is 27711997. The next prime is 27712031. The reversal of 27712021 is 12021772.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 26471025 + 1240996 = 5145^2 + 1114^2 .
It is a cyclic number.
It is not a de Polignac number, because 27712021 - 219 = 27187733 is a prime.
It is a super-2 number, since 2×277120212 = 1535912215808882, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 27711983 and 27712001.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (27712031) 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, 13856010 + 13856011.
It is an arithmetic number, because the mean of its divisors is an integer number (13856011).
Almost surely, 227712021 is an apocalyptic number.
It is an amenable number.
27712021 is a deficient number, since it is larger than the sum of its proper divisors (1).
27712021 is an equidigital number, since it uses as much as digits as its factorization.
27712021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 392, while the sum is 22.
The square root of 27712021 is about 5264.2208350334. The cubic root of 27712021 is about 302.6142673288.
Adding to 27712021 its reverse (12021772), we get a palindrome (39733793).
The spelling of 27712021 in words is "twenty-seven million, seven hundred twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •