Base | Representation |
---|---|
bin | 110011101011… |
… | …0100100010101 |
3 | 1212222110222102 |
4 | 1213112210111 |
5 | 23413441034 |
6 | 2404411445 |
7 | 446201060 |
oct | 147264425 |
9 | 55873872 |
10 | 27093269 |
11 | 14325635 |
12 | 90a6b85 |
13 | 57c7c28 |
14 | 38538d7 |
15 | 25a297e |
hex | 19d6915 |
27093269 has 4 divisors (see below), whose sum is σ = 30963744. Its totient is φ = 23222796.
The previous prime is 27093263. The next prime is 27093281. The reversal of 27093269 is 96239072.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 27093269 - 28 = 27093013 is a prime.
It is a super-2 number, since 2×270932692 = 1468090450212722, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (27093263) 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 in 3 ways as a sum of consecutive naturals, for example, 1935227 + ... + 1935240.
It is an arithmetic number, because the mean of its divisors is an integer number (7740936).
Almost surely, 227093269 is an apocalyptic number.
It is an amenable number.
27093269 is a deficient number, since it is larger than the sum of its proper divisors (3870475).
27093269 is an equidigital number, since it uses as much as digits as its factorization.
27093269 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3870474.
The product of its (nonzero) digits is 40824, while the sum is 38.
The square root of 27093269 is about 5205.1194991085. The cubic root of 27093269 is about 300.3450437380.
It can be divided in two parts, 270 and 93269, that added together give a palindrome (93539).
The spelling of 27093269 in words is "twenty-seven million, ninety-three thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •