Base | Representation |
---|---|
bin | 110100110001… |
… | …1011001000000 |
3 | 1221001210012210 |
4 | 1221203121000 |
5 | 24040420310 |
6 | 2425022120 |
7 | 454122534 |
oct | 151433100 |
9 | 57053183 |
10 | 27670080 |
11 | 14689a39 |
12 | 9324940 |
13 | 596a639 |
14 | 3963bc4 |
15 | 2668820 |
hex | 1a63640 |
27670080 has 224 divisors, whose sum is σ = 97292160. Its totient is φ = 6635520.
The previous prime is 27670057. The next prime is 27670103. The reversal of 27670080 is 8007672.
It is an interprime number because it is at equal distance from previous prime (27670057) and next prime (27670103).
It is a Harshad number since it is a multiple of its sum of digits (30).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 674860 + ... + 674900.
It is an arithmetic number, because the mean of its divisors is an integer number (434340).
Almost surely, 227670080 is an apocalyptic number.
27670080 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 27670080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (48646080).
27670080 is an abundant number, since it is smaller than the sum of its proper divisors (69622080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27670080 is a wasteful number, since it uses less digits than its factorization.
27670080 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 117 (or 107 counting only the distinct ones).
The product of its (nonzero) digits is 4704, while the sum is 30.
The square root of 27670080 is about 5260.2357361624. The cubic root of 27670080 is about 302.4615255122.
The spelling of 27670080 in words is "twenty-seven million, six hundred seventy thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •