Base | Representation |
---|---|
bin | 1100001110111… |
… | …1100001101110 |
3 | 10120112221212020 |
4 | 3003233201232 |
5 | 101114002000 |
6 | 5031451010 |
7 | 1162102566 |
oct | 303574156 |
9 | 116487766 |
10 | 51312750 |
11 | 26a68035 |
12 | 15226a66 |
13 | a827a98 |
14 | 6b59da6 |
15 | 4788ba0 |
hex | 30ef86e |
51312750 has 64 divisors (see below), whose sum is σ = 132268032. Its totient is φ = 13236000.
The previous prime is 51312739. The next prime is 51312757. The reversal of 51312750 is 5721315.
It is a self number, because there is not a number n which added to its sum of digits gives 51312750.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51312757) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 22147 + ... + 24353.
It is an arithmetic number, because the mean of its divisors is an integer number (2066688).
Almost surely, 251312750 is an apocalyptic number.
51312750 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 51312750, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (66134016).
51312750 is an abundant number, since it is smaller than the sum of its proper divisors (80955282).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51312750 is a wasteful number, since it uses less digits than its factorization.
51312750 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2258 (or 2248 counting only the distinct ones).
The product of its (nonzero) digits is 1050, while the sum is 24.
The square root of 51312750 is about 7163.2918410463. The cubic root of 51312750 is about 371.5994793210.
The spelling of 51312750 in words is "fifty-one million, three hundred twelve thousand, seven hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •