Base | Representation |
---|---|
bin | 110100000110… |
… | …1111010111000 |
3 | 1220101222222120 |
4 | 1220031322320 |
5 | 23443214432 |
6 | 2413321240 |
7 | 451134060 |
oct | 150157270 |
9 | 56358876 |
10 | 27319992 |
11 | 1446aa07 |
12 | 9196220 |
13 | 587719b |
14 | 38b23a0 |
15 | 25e9c2c |
hex | 1a0deb8 |
27319992 has 64 divisors (see below), whose sum is σ = 78693120. Its totient is φ = 7742208.
The previous prime is 27319939. The next prime is 27319993. The reversal of 27319992 is 29991372.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (27319993) by changing a digit.
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, 22423 + ... + 23609.
It is an arithmetic number, because the mean of its divisors is an integer number (1229580).
Almost surely, 227319992 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 27319992, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (39346560).
27319992 is an abundant number, since it is smaller than the sum of its proper divisors (51373128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27319992 is a wasteful number, since it uses less digits than its factorization.
27319992 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1340 (or 1336 counting only the distinct ones).
The product of its digits is 61236, while the sum is 42.
The square root of 27319992 is about 5226.8529728700. The cubic root of 27319992 is about 301.1805041622.
The spelling of 27319992 in words is "twenty-seven million, three hundred nineteen thousand, nine hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •