Base | Representation |
---|---|
bin | 110011101010… |
… | …1111000000000 |
3 | 1212222100002100 |
4 | 1213111320000 |
5 | 23413343212 |
6 | 2404350400 |
7 | 446156565 |
oct | 147257000 |
9 | 55870070 |
10 | 27090432 |
11 | 14323496 |
12 | 90a5400 |
13 | 57c6855 |
14 | 385286c |
15 | 25a1bdc |
hex | 19d5e00 |
27090432 has 60 divisors (see below), whose sum is σ = 78198120. Its totient is φ = 9028608.
The previous prime is 27090431. The next prime is 27090491. The reversal of 27090432 is 23409072.
It is a junction number, because it is equal to n+sod(n) for n = 27090396 and 27090405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (27090431) 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, 1669 + ... + 7547.
It is an arithmetic number, because the mean of its divisors is an integer number (1303302).
Almost surely, 227090432 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 27090432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (39099060).
27090432 is an abundant number, since it is smaller than the sum of its proper divisors (51107688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27090432 is an equidigital number, since it uses as much as digits as its factorization.
27090432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5903 (or 5884 counting only the distinct ones).
The product of its (nonzero) digits is 3024, while the sum is 27.
The square root of 27090432 is about 5204.8469718139. The cubic root of 27090432 is about 300.3345600931.
The spelling of 27090432 in words is "twenty-seven million, ninety thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •