Base | Representation |
---|---|
bin | 110011110100… |
… | …0100110010000 |
3 | 1220010020021122 |
4 | 1213220212100 |
5 | 23423321440 |
6 | 2410141412 |
7 | 446626301 |
oct | 147504620 |
9 | 56106248 |
10 | 27167120 |
11 | 14376072 |
12 | 9121868 |
13 | 5822726 |
14 | 38727a8 |
15 | 25b97b5 |
hex | 19e8990 |
27167120 has 20 divisors (see below), whose sum is σ = 63163740. Its totient is φ = 10866816.
The previous prime is 27167089. The next prime is 27167137. The reversal of 27167120 is 2176172.
It can be written as a sum of positive squares in 2 ways, for example, as 3625216 + 23541904 = 1904^2 + 4852^2 .
It is a tau number, because it is divible by the number of its divisors (20).
It is a self number, because there is not a number n which added to its sum of digits gives 27167120.
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, 169715 + ... + 169874.
It is an arithmetic number, because the mean of its divisors is an integer number (3158187).
Almost surely, 227167120 is an apocalyptic number.
27167120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
27167120 is an abundant number, since it is smaller than the sum of its proper divisors (35996620).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27167120 is a wasteful number, since it uses less digits than its factorization.
27167120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 339602 (or 339596 counting only the distinct ones).
The product of its (nonzero) digits is 1176, while the sum is 26.
The square root of 27167120 is about 5212.2087448605. The cubic root of 27167120 is about 300.6176902858.
The spelling of 27167120 in words is "twenty-seven million, one hundred sixty-seven thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •