Base | Representation |
---|---|
bin | 110011101010… |
… | …0010011001110 |
3 | 1212222000020110 |
4 | 1213110103032 |
5 | 23413141412 |
6 | 2404300450 |
7 | 446132022 |
oct | 147242316 |
9 | 55860213 |
10 | 27083982 |
11 | 14319662 |
12 | 90a1726 |
13 | 57c3933 |
14 | 3850382 |
15 | 259ed3c |
hex | 19d44ce |
27083982 has 8 divisors (see below), whose sum is σ = 54167976. Its totient is φ = 9027992.
The previous prime is 27083981. The next prime is 27083983. The reversal of 27083982 is 28938072.
It is an interprime number because it is at equal distance from previous prime (27083981) and next prime (27083983).
It is a sphenic number, since it is the product of 3 distinct primes.
27083982 is an admirable number.
It is a self number, because there is not a number n which added to its sum of digits gives 27083982.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (27083981) 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 3 ways as a sum of consecutive naturals, for example, 2256993 + ... + 2257004.
It is an arithmetic number, because the mean of its divisors is an integer number (6770997).
Almost surely, 227083982 is an apocalyptic number.
27083982 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27083982 is a wasteful number, since it uses less digits than its factorization.
27083982 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4514002.
The product of its (nonzero) digits is 48384, while the sum is 39.
The square root of 27083982 is about 5204.2273201696. The cubic root of 27083982 is about 300.3107225051.
The spelling of 27083982 in words is "twenty-seven million, eighty-three thousand, nine hundred eighty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •