Base | Representation |
---|---|
bin | 110011100110… |
… | …0100111111001 |
3 | 1212220102002211 |
4 | 1213030213321 |
5 | 23411140122 |
6 | 2403455121 |
7 | 445641241 |
oct | 147144771 |
9 | 55812084 |
10 | 27052537 |
11 | 142a7a76 |
12 | 90874a1 |
13 | 57b2525 |
14 | 3842b21 |
15 | 2595877 |
hex | 19cc9f9 |
27052537 has 4 divisors (see below), whose sum is σ = 27065700. Its totient is φ = 27039376.
The previous prime is 27052517. The next prime is 27052549. The reversal of 27052537 is 73525072.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 26378496 + 674041 = 5136^2 + 821^2 .
It is a cyclic number.
It is not a de Polignac number, because 27052537 - 211 = 27050489 is a prime.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 27052499 and 27052508.
It is not an unprimeable number, because it can be changed into a prime (27052507) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2758 + ... + 7855.
It is an arithmetic number, because the mean of its divisors is an integer number (6766425).
Almost surely, 227052537 is an apocalyptic number.
It is an amenable number.
27052537 is a deficient number, since it is larger than the sum of its proper divisors (13163).
27052537 is a wasteful number, since it uses less digits than its factorization.
27052537 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13162.
The product of its (nonzero) digits is 14700, while the sum is 31.
The square root of 27052537 is about 5201.2053410724. The cubic root of 27052537 is about 300.1944554112.
The spelling of 27052537 in words is "twenty-seven million, fifty-two thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •