Base | Representation |
---|---|
bin | 110011100110… |
… | …1111111101001 |
3 | 1212220200210211 |
4 | 1213031333221 |
5 | 23411330103 |
6 | 2403541121 |
7 | 445663513 |
oct | 147157751 |
9 | 55820724 |
10 | 27058153 |
11 | 14301211 |
12 | 908a7a1 |
13 | 57b4c55 |
14 | 3844bb3 |
15 | 259736d |
hex | 19cdfe9 |
27058153 has 4 divisors (see below), whose sum is σ = 27089748. Its totient is φ = 27026560.
The previous prime is 27058139. The next prime is 27058159. The reversal of 27058153 is 35185072.
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 15031129 + 12027024 = 3877^2 + 3468^2 .
It is a cyclic number.
It is not a de Polignac number, because 27058153 - 25 = 27058121 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 not an unprimeable number, because it can be changed into a prime (27058159) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14476 + ... + 16237.
It is an arithmetic number, because the mean of its divisors is an integer number (6772437).
Almost surely, 227058153 is an apocalyptic number.
It is an amenable number.
27058153 is a deficient number, since it is larger than the sum of its proper divisors (31595).
27058153 is an equidigital number, since it uses as much as digits as its factorization.
27058153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31594.
The product of its (nonzero) digits is 8400, while the sum is 31.
The square root of 27058153 is about 5201.7451879153. The cubic root of 27058153 is about 300.2152270356.
The spelling of 27058153 in words is "twenty-seven million, fifty-eight thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •