Base | Representation |
---|---|
bin | 110101011001… |
… | …0001110101000 |
3 | 1221200012011210 |
4 | 1222302032220 |
5 | 24131234000 |
6 | 2435553120 |
7 | 456636150 |
oct | 152621650 |
9 | 57605153 |
10 | 27993000 |
11 | 1488a612 |
12 | 945b7a0 |
13 | 5a51609 |
14 | 3a09760 |
15 | 26ce350 |
hex | 1ab23a8 |
27993000 has 256 divisors, whose sum is σ = 105431040. Its totient is φ = 6048000.
The previous prime is 27992989. The next prime is 27993011. The reversal of 27993000 is 39972.
It is an interprime number because it is at equal distance from previous prime (27992989) and next prime (27993011).
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 650979 + ... + 651021.
It is an arithmetic number, because the mean of its divisors is an integer number (411840).
Almost surely, 227993000 is an apocalyptic number.
27993000 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 27993000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (52715520).
27993000 is an abundant number, since it is smaller than the sum of its proper divisors (77438040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27993000 is a wasteful number, since it uses less digits than its factorization.
27993000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 105 (or 91 counting only the distinct ones).
The product of its (nonzero) digits is 3402, while the sum is 30.
The square root of 27993000 is about 5290.8411429564. The cubic root of 27993000 is about 303.6335901704.
The spelling of 27993000 in words is "twenty-seven million, nine hundred ninety-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •