Base | Representation |
---|---|
bin | 110100001001… |
… | …0110100100101 |
3 | 1220110000112011 |
4 | 1220102310211 |
5 | 23444340234 |
6 | 2413554221 |
7 | 451246441 |
oct | 150226445 |
9 | 56400464 |
10 | 27340069 |
11 | 14483aa9 |
12 | 91a5971 |
13 | 5883373 |
14 | 38b9821 |
15 | 2600b64 |
hex | 1a12d25 |
27340069 has 16 divisors (see below), whose sum is σ = 30312000. Its totient is φ = 24584112.
The previous prime is 27340067. The next prime is 27340111. The reversal of 27340069 is 96004372.
It is not a de Polignac number, because 27340069 - 21 = 27340067 is a prime.
It is a super-2 number, since 2×273400692 = 1494958745849522, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 27340069.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (27340067) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 463362 + ... + 463420.
It is an arithmetic number, because the mean of its divisors is an integer number (1894500).
Almost surely, 227340069 is an apocalyptic number.
27340069 is a gapful number since it is divisible by the number (29) formed by its first and last digit.
It is an amenable number.
27340069 is a deficient number, since it is larger than the sum of its proper divisors (2971931).
27340069 is an frugal number, since it uses more digits than its factorization.
27340069 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 165 (or 107 counting only the distinct ones).
The product of its (nonzero) digits is 9072, while the sum is 31.
The square root of 27340069 is about 5228.7731830708. The cubic root of 27340069 is about 301.2542635830.
The spelling of 27340069 in words is "twenty-seven million, three hundred forty thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •