Base | Representation |
---|---|
bin | 1100001100000… |
… | …0001000000000 |
3 | 10120012002112012 |
4 | 3003000020000 |
5 | 101041243332 |
6 | 5023352052 |
7 | 1160333540 |
oct | 303001000 |
9 | 116162465 |
10 | 51118592 |
11 | 26945178 |
12 | 15152628 |
13 | a78a5b5 |
14 | 6b09320 |
15 | 474b3b2 |
hex | 30c0200 |
51118592 has 80 divisors (see below), whose sum is σ = 123742080. Its totient is φ = 20594688.
The previous prime is 51118589. The next prime is 51118631. The reversal of 51118592 is 29581115.
It is a super-2 number, since 2×511185922 = 5226220896124928, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (5) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 60509 + ... + 61347.
It is an arithmetic number, because the mean of its divisors is an integer number (1546776).
Almost surely, 251118592 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 51118592, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (61871040).
51118592 is an abundant number, since it is smaller than the sum of its proper divisors (72623488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51118592 is an equidigital number, since it uses as much as digits as its factorization.
51118592 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 881 (or 865 counting only the distinct ones).
The product of its digits is 3600, while the sum is 32.
The square root of 51118592 is about 7149.7267080637. The cubic root of 51118592 is about 371.1301989245.
The spelling of 51118592 in words is "fifty-one million, one hundred eighteen thousand, five hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •