Base | Representation |
---|---|
bin | 110100000110… |
… | …1111010100000 |
3 | 1220101222221200 |
4 | 1220031322200 |
5 | 23443214333 |
6 | 2413321200 |
7 | 451134024 |
oct | 150157240 |
9 | 56358850 |
10 | 27319968 |
11 | 1446a995 |
12 | 9196200 |
13 | 5877180 |
14 | 38b2384 |
15 | 25e9c13 |
hex | 1a0dea0 |
27319968 has 72 divisors (see below), whose sum is σ = 83678868. Its totient is φ = 8404992.
The previous prime is 27319939. The next prime is 27319993. The reversal of 27319968 is 86991372.
It can be written as a sum of positive squares in 2 ways, for example, as 25280784 + 2039184 = 5028^2 + 1428^2 .
It is a tau number, because it is divible by the number of its divisors (72).
It is a Smith number, since the sum of its digits (45) coincides with the sum of the digits of its prime factors.
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 11 ways as a sum of consecutive naturals, for example, 96 + ... + 7392.
Almost surely, 227319968 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 27319968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (41839434).
27319968 is an abundant number, since it is smaller than the sum of its proper divisors (56358900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27319968 is a wasteful number, since it uses less digits than its factorization.
27319968 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7326 (or 7315 counting only the distinct ones).
The product of its digits is 163296, while the sum is 45.
The square root of 27319968 is about 5226.8506770330. The cubic root of 27319968 is about 301.1804159687.
The spelling of 27319968 in words is "twenty-seven million, three hundred nineteen thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •