Base | Representation |
---|---|
bin | 110101011001… |
… | …0111101100000 |
3 | 1221200100021220 |
4 | 1222302331200 |
5 | 24131333000 |
6 | 2440015040 |
7 | 456650664 |
oct | 152627540 |
9 | 57610256 |
10 | 27996000 |
11 | 1489189a |
12 | 9461480 |
13 | 5a52aa6 |
14 | 3a0a8a4 |
15 | 26d01a0 |
hex | 1ab2f60 |
27996000 has 96 divisors (see below), whose sum is σ = 91754208. Its totient is φ = 7462400.
The previous prime is 27995999. The next prime is 27996091. The reversal of 27996000 is 69972.
It is a tau number, because it is divible by the number of its divisors (96).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10834 + ... + 13166.
It is an arithmetic number, because the mean of its divisors is an integer number (955773).
Almost surely, 227996000 is an apocalyptic number.
27996000 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 27996000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (45877104).
27996000 is an abundant number, since it is smaller than the sum of its proper divisors (63758208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27996000 is a wasteful number, since it uses less digits than its factorization.
27996000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2361 (or 2343 counting only the distinct ones).
The product of its (nonzero) digits is 6804, while the sum is 33.
The square root of 27996000 is about 5291.1246441565. The cubic root of 27996000 is about 303.6444365515.
The spelling of 27996000 in words is "twenty-seven million, nine hundred ninety-six thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •