Base | Representation |
---|---|
bin | 110101010101… |
… | …0100001010100 |
3 | 1221121120212110 |
4 | 1222222201110 |
5 | 24124231203 |
6 | 2435151020 |
7 | 456445125 |
oct | 152524124 |
9 | 57546773 |
10 | 27961428 |
11 | 14868920 |
12 | 9445470 |
13 | 5a40131 |
14 | 39dc04c |
15 | 26c4d03 |
hex | 1aaa854 |
27961428 has 48 divisors (see below), whose sum is σ = 72705024. Its totient is φ = 8291040.
The previous prime is 27961393. The next prime is 27961429. The reversal of 27961428 is 82416972.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (27961429) 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, 3951 + ... + 8457.
It is an arithmetic number, because the mean of its divisors is an integer number (1514688).
Almost surely, 227961428 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 27961428, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (36352512).
27961428 is an abundant number, since it is smaller than the sum of its proper divisors (44743596).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27961428 is a wasteful number, since it uses less digits than its factorization.
27961428 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4572 (or 4570 counting only the distinct ones).
The product of its digits is 48384, while the sum is 39.
The square root of 27961428 is about 5287.8566546381. The cubic root of 27961428 is about 303.5193958367.
It can be divided in two parts, 2796 and 1428, that added together give a palindrome (4224).
The spelling of 27961428 in words is "twenty-seven million, nine hundred sixty-one thousand, four hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •