Base | Representation |
---|---|
bin | 1100010100001… |
… | …1011010001100 |
3 | 10121012102011111 |
4 | 3011003122030 |
5 | 101211000312 |
6 | 5043101404 |
7 | 1165033360 |
oct | 305033214 |
9 | 117172144 |
10 | 51656332 |
11 | 27182192 |
12 | 15371864 |
13 | a9182a0 |
14 | 6c092a0 |
15 | 48058a7 |
hex | 314368c |
51656332 has 48 divisors (see below), whose sum is σ = 111992832. Its totient is φ = 20301120.
The previous prime is 51656309. The next prime is 51656369. The reversal of 51656332 is 23365615.
It is a junction number, because it is equal to n+sod(n) for n = 51656294 and 51656303.
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 15 ways as a sum of consecutive naturals, for example, 69153 + ... + 69895.
It is an arithmetic number, because the mean of its divisors is an integer number (2333184).
Almost surely, 251656332 is an apocalyptic number.
51656332 is a gapful number since it is divisible by the number (52) 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 51656332, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (55996416).
51656332 is an abundant number, since it is smaller than the sum of its proper divisors (60336500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51656332 is a wasteful number, since it uses less digits than its factorization.
51656332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 958 (or 956 counting only the distinct ones).
The product of its digits is 16200, while the sum is 31.
The square root of 51656332 is about 7187.2339602938. The cubic root of 51656332 is about 372.4270253277.
The spelling of 51656332 in words is "fifty-one million, six hundred fifty-six thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •