Base | Representation |
---|---|
bin | 110101010010… |
… | …1011000101000 |
3 | 1221120112000100 |
4 | 1222211120220 |
5 | 24123043032 |
6 | 2434505400 |
7 | 456326604 |
oct | 152453050 |
9 | 57515010 |
10 | 27940392 |
11 | 14854037 |
12 | 9435260 |
13 | 5a3369c |
14 | 39d4504 |
15 | 26bd97c |
hex | 1aa5628 |
27940392 has 48 divisors (see below), whose sum is σ = 75996180. Its totient is φ = 9273600.
The previous prime is 27940391. The next prime is 27940399. The reversal of 27940392 is 29304972.
It can be written as a sum of positive squares in 2 ways, for example, as 27815076 + 125316 = 5274^2 + 354^2 .
It is a super-2 number, since 2×279403922 = 1561331010227328, which contains 22 as substring.
It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (27940391) by changing a digit.
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, 19542 + ... + 20922.
Almost surely, 227940392 is an apocalyptic number.
It is an amenable number.
27940392 is an abundant number, since it is smaller than the sum of its proper divisors (48055788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27940392 is a wasteful number, since it uses less digits than its factorization.
27940392 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1674 (or 1667 counting only the distinct ones).
The product of its (nonzero) digits is 27216, while the sum is 36.
The square root of 27940392 is about 5285.8671946995. The cubic root of 27940392 is about 303.4432619588.
The spelling of 27940392 in words is "twenty-seven million, nine hundred forty thousand, three hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •