Base | Representation |
---|---|
bin | 110011100000… |
… | …1000001000000 |
3 | 1212210222212220 |
4 | 1213001001000 |
5 | 23403124432 |
6 | 2402451040 |
7 | 445352520 |
oct | 147010100 |
9 | 55728786 |
10 | 27004992 |
11 | 14275283 |
12 | 9063a80 |
13 | 57969b1 |
14 | 382d680 |
15 | 258672c |
hex | 19c1040 |
27004992 has 112 divisors (see below), whose sum is σ = 83100672. Its totient is φ = 7580160.
The previous prime is 27004951. The next prime is 27004997. The reversal of 27004992 is 29940072.
It is a tau number, because it is divible by the number of its divisors (112).
It is a hoax number, since the sum of its digits (33) coincides with the sum of the digits of its distinct prime factors.
It is not an unprimeable number, because it can be changed into a prime (27004997) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 95283 + ... + 95565.
Almost surely, 227004992 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 27004992, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (41550336).
27004992 is an abundant number, since it is smaller than the sum of its proper divisors (56095680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27004992 is a wasteful number, since it uses less digits than its factorization.
27004992 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 376 (or 366 counting only the distinct ones).
The product of its (nonzero) digits is 9072, while the sum is 33.
The square root of 27004992 is about 5196.6327559296. The cubic root of 27004992 is about 300.0184877495.
The spelling of 27004992 in words is "twenty-seven million, four thousand, nine hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •