Base | Representation |
---|---|
bin | 1100010011110… |
… | …0010100010010 |
3 | 10121010221022120 |
4 | 3010330110102 |
5 | 101204033112 |
6 | 5042315110 |
7 | 1164552600 |
oct | 304742422 |
9 | 117127276 |
10 | 51627282 |
11 | 27162383 |
12 | 15358a96 |
13 | a907cb5 |
14 | 6bdc870 |
15 | 47ebe8c |
hex | 313c512 |
51627282 has 48 divisors (see below), whose sum is σ = 123070752. Its totient is φ = 14387520.
The previous prime is 51627271. The next prime is 51627293. The reversal of 51627282 is 28272615.
It is an interprime number because it is at equal distance from previous prime (51627271) and next prime (51627293).
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 9913 + ... + 14195.
It is an arithmetic number, because the mean of its divisors is an integer number (2563974).
Almost surely, 251627282 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 51627282, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (61535376).
51627282 is an abundant number, since it is smaller than the sum of its proper divisors (71443470).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51627282 is a wasteful number, since it uses less digits than its factorization.
51627282 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4343 (or 4336 counting only the distinct ones).
The product of its digits is 13440, while the sum is 33.
The square root of 51627282 is about 7185.2127317150. The cubic root of 51627282 is about 372.3571982390.
Adding to 51627282 its reverse (28272615), we get a palindrome (79899897).
The spelling of 51627282 in words is "fifty-one million, six hundred twenty-seven thousand, two hundred eighty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.259 sec. • engine limits •