Base | Representation |
---|---|
bin | 110101000110… |
… | …0100111100101 |
3 | 1221101100212012 |
4 | 1222030213211 |
5 | 24111321244 |
6 | 2432404005 |
7 | 455425055 |
oct | 152144745 |
9 | 57340765 |
10 | 27838949 |
11 | 147948a6 |
12 | 93a6605 |
13 | 59c9468 |
14 | 39a9565 |
15 | 269d89e |
hex | 1a8c9e5 |
27838949 has 2 divisors, whose sum is σ = 27838950. Its totient is φ = 27838948.
The previous prime is 27838919. The next prime is 27838957. The reversal of 27838949 is 94983872.
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., 27772900 + 66049 = 5270^2 + 257^2 .
It is a cyclic number.
It is not a de Polignac number, because 27838949 - 28 = 27838693 is a prime.
It is a Sophie Germain prime.
It is an alternating number because its digits alternate between even and odd.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 27838897 and 27838906.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (27838919) 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, 13919474 + 13919475.
It is an arithmetic number, because the mean of its divisors is an integer number (13919475).
Almost surely, 227838949 is an apocalyptic number.
It is an amenable number.
27838949 is a deficient number, since it is larger than the sum of its proper divisors (1).
27838949 is an equidigital number, since it uses as much as digits as its factorization.
27838949 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 870912, while the sum is 50.
The square root of 27838949 is about 5276.2627872387. The cubic root of 27838949 is about 303.0755801248.
The spelling of 27838949 in words is "twenty-seven million, eight hundred thirty-eight thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •