Base | Representation |
---|---|
bin | 110100111000… |
… | …1110011010100 |
3 | 1221011210012000 |
4 | 1221301303110 |
5 | 24044312413 |
6 | 2430155300 |
7 | 454456611 |
oct | 151616324 |
9 | 57153160 |
10 | 27729108 |
11 | 1471a320 |
12 | 9352b30 |
13 | 598b474 |
14 | 397b508 |
15 | 267b073 |
hex | 1a71cd4 |
27729108 has 96 divisors (see below), whose sum is σ = 83099520. Its totient is φ = 7902720.
The previous prime is 27729103. The next prime is 27729127. The reversal of 27729108 is 80192772.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (27729101) 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 31 ways as a sum of consecutive naturals, for example, 19510 + ... + 20882.
It is an arithmetic number, because the mean of its divisors is an integer number (865620).
Almost surely, 227729108 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 27729108, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (41549760).
27729108 is an abundant number, since it is smaller than the sum of its proper divisors (55370412).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27729108 is a wasteful number, since it uses less digits than its factorization.
27729108 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1414 (or 1406 counting only the distinct ones).
The product of its (nonzero) digits is 14112, while the sum is 36.
The square root of 27729108 is about 5265.8435221719. The cubic root of 27729108 is about 302.6764510239.
The spelling of 27729108 in words is "twenty-seven million, seven hundred twenty-nine thousand, one hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •