Base | Representation |
---|---|
bin | 1100010100100… |
… | …0000000000000 |
3 | 10121020100221221 |
4 | 3011020000000 |
5 | 101212101021 |
6 | 5043324424 |
7 | 1165142242 |
oct | 305100000 |
9 | 117210857 |
10 | 51675136 |
11 | 27195327 |
12 | 15380714 |
13 | a923a06 |
14 | 6c12092 |
15 | 480b241 |
hex | 3148000 |
51675136 has 64 divisors (see below), whose sum is σ = 110098800. Its totient is φ = 24182784.
The previous prime is 51675133. The next prime is 51675139. The reversal of 51675136 is 63157615.
It is an interprime number because it is at equal distance from previous prime (51675133) and next prime (51675139).
It is a tau number, because it is divible by the number of its divisors (64).
It is not an unprimeable number, because it can be changed into a prime (51675133) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 622551 + ... + 622633.
Almost surely, 251675136 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 51675136, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (55049400).
51675136 is an abundant number, since it is smaller than the sum of its proper divisors (58423664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51675136 is an frugal number, since it uses more digits than its factorization.
51675136 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 132 (or 104 counting only the distinct ones).
The product of its digits is 18900, while the sum is 34.
The square root of 51675136 is about 7188.5419940347. The cubic root of 51675136 is about 372.4722102897.
The spelling of 51675136 in words is "fifty-one million, six hundred seventy-five thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •