Base | Representation |
---|---|
bin | 1100010101101… |
… | …0001101010000 |
3 | 10121101011021000 |
4 | 3011122031100 |
5 | 101221442322 |
6 | 5045102000 |
7 | 1165602540 |
oct | 305321520 |
9 | 117334230 |
10 | 51749712 |
11 | 27236363 |
12 | 153b7900 |
13 | a94b941 |
14 | 6c31320 |
15 | 48233ac |
hex | 315a350 |
51749712 has 160 divisors (see below), whose sum is σ = 172409600. Its totient is φ = 14556672.
The previous prime is 51749707. The next prime is 51749713. The reversal of 51749712 is 21794715.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51749713) 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 31 ways as a sum of consecutive naturals, for example, 329538 + ... + 329694.
It is an arithmetic number, because the mean of its divisors is an integer number (1077560).
Almost surely, 251749712 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 51749712, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (86204800).
51749712 is an abundant number, since it is smaller than the sum of its proper divisors (120659888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51749712 is a wasteful number, since it uses less digits than its factorization.
51749712 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 290 (or 278 counting only the distinct ones).
The product of its digits is 17640, while the sum is 36.
The square root of 51749712 is about 7193.7272675575. The cubic root of 51749712 is about 372.6513043883.
The spelling of 51749712 in words is "fifty-one million, seven hundred forty-nine thousand, seven hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •