Base | Representation |
---|---|
bin | 110011110010… |
… | …0001101010000 |
3 | 1220002022121120 |
4 | 1213210031100 |
5 | 23422233021 |
6 | 2405522240 |
7 | 446523000 |
oct | 147441520 |
9 | 56068546 |
10 | 27149136 |
11 | 14363603 |
12 | 9113380 |
13 | 58174a1 |
14 | 386a000 |
15 | 25b42c6 |
hex | 19e4350 |
27149136 has 160 divisors (see below), whose sum is σ = 87494400. Its totient is φ = 7225344.
The previous prime is 27149113. The next prime is 27149147. The reversal of 27149136 is 63194172.
Its product of digits (9072) is a multiple of the sum of its prime divisors (126).
It is a junction number, because it is equal to n+sod(n) for n = 27149097 and 27149106.
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 31 ways as a sum of consecutive naturals, for example, 279840 + ... + 279936.
It is an arithmetic number, because the mean of its divisors is an integer number (546840).
Almost surely, 227149136 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 27149136, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (43747200).
27149136 is an abundant number, since it is smaller than the sum of its proper divisors (60345264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27149136 is a wasteful number, since it uses less digits than its factorization.
27149136 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 146 (or 126 counting only the distinct ones).
The product of its digits is 9072, while the sum is 33.
The square root of 27149136 is about 5210.4832789291. The cubic root of 27149136 is about 300.5513416760.
The spelling of 27149136 in words is "twenty-seven million, one hundred forty-nine thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •