Base | Representation |
---|---|
bin | 110101010101… |
… | …1000100011000 |
3 | 1221121200221120 |
4 | 1222223010120 |
5 | 24124314142 |
6 | 2435205240 |
7 | 456454512 |
oct | 152530430 |
9 | 57550846 |
10 | 27963672 |
11 | 1486a580 |
12 | 9446820 |
13 | 5a41169 |
14 | 39dcbb2 |
15 | 26c57ec |
hex | 1aab118 |
27963672 has 64 divisors (see below), whose sum is σ = 77362560. Its totient is φ = 8352000.
The previous prime is 27963671. The next prime is 27963703. The reversal of 27963672 is 27636972.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (27963671) 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 15 ways as a sum of consecutive naturals, for example, 18547 + ... + 19997.
It is an arithmetic number, because the mean of its divisors is an integer number (1208790).
Almost surely, 227963672 is an apocalyptic number.
27963672 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 27963672, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (38681280).
27963672 is an abundant number, since it is smaller than the sum of its proper divisors (49398888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27963672 is a wasteful number, since it uses less digits than its factorization.
27963672 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1544 (or 1540 counting only the distinct ones).
The product of its digits is 190512, while the sum is 42.
The square root of 27963672 is about 5288.0688346503. The cubic root of 27963672 is about 303.5275151085.
The spelling of 27963672 in words is "twenty-seven million, nine hundred sixty-three thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •