Base | Representation |
---|---|
bin | 110100010001… |
… | …0110010011100 |
3 | 1220120100020100 |
4 | 1220202302130 |
5 | 24003433333 |
6 | 2415221100 |
7 | 451641216 |
oct | 150426234 |
9 | 56510210 |
10 | 27405468 |
11 | 14519152 |
12 | 9217790 |
13 | 58a706c |
14 | 38d55b6 |
15 | 2615213 |
hex | 1a22c9c |
27405468 has 18 divisors (see below), whose sum is σ = 69275024. Its totient is φ = 9135144.
The previous prime is 27405463. The next prime is 27405473. The reversal of 27405468 is 86450472.
It is an interprime number because it is at equal distance from previous prime (27405463) and next prime (27405473).
It is a tau number, because it is divible by the number of its divisors (18).
It is a Harshad number since it is a multiple of its sum of digits (36), and also a Moran number because the ratio is a prime number: 761263 = 27405468 / (2 + 7 + 4 + 0 + 5 + 4 + 6 + 8).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (27405461) 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 5 ways as a sum of consecutive naturals, for example, 380596 + ... + 380667.
Almost surely, 227405468 is an apocalyptic number.
It is an amenable number.
27405468 is an abundant number, since it is smaller than the sum of its proper divisors (41869556).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27405468 is a wasteful number, since it uses less digits than its factorization.
27405468 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 761273 (or 761268 counting only the distinct ones).
The product of its (nonzero) digits is 53760, while the sum is 36.
The square root of 27405468 is about 5235.0232091176. The cubic root of 27405468 is about 301.4942780858.
The spelling of 27405468 in words is "twenty-seven million, four hundred five thousand, four hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •