Base | Representation |
---|---|
bin | 110100010001… |
… | …0001111011000 |
3 | 1220120020011020 |
4 | 1220202033120 |
5 | 24003400344 |
6 | 2415202440 |
7 | 451631532 |
oct | 150421730 |
9 | 56506136 |
10 | 27403224 |
11 | 145174a2 |
12 | 9216420 |
13 | 58a6034 |
14 | 38d4852 |
15 | 2614719 |
hex | 1a223d8 |
27403224 has 16 divisors (see below), whose sum is σ = 68508120. Its totient is φ = 9134400.
The previous prime is 27403193. The next prime is 27403237. The reversal of 27403224 is 42230472.
It is a Harshad number since it is a multiple of its sum of digits (24), and also a Moran number because the ratio is a prime number: 1141801 = 27403224 / (2 + 7 + 4 + 0 + 3 + 2 + 2 + 4).
It is a junction number, because it is equal to n+sod(n) for n = 27403194 and 27403203.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 570877 + ... + 570924.
Almost surely, 227403224 is an apocalyptic number.
27403224 is a gapful number since it is divisible by the number (24) formed by its first and last digit.
It is an amenable number.
27403224 is an abundant number, since it is smaller than the sum of its proper divisors (41104896).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27403224 is a wasteful number, since it uses less digits than its factorization.
27403224 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1141810 (or 1141806 counting only the distinct ones).
The product of its (nonzero) digits is 2688, while the sum is 24.
The square root of 27403224 is about 5234.8088790327. The cubic root of 27403224 is about 301.4860489297.
Adding to 27403224 its reverse (42230472), we get a palindrome (69633696).
The spelling of 27403224 in words is "twenty-seven million, four hundred three thousand, two hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •