Base | Representation |
---|---|
bin | 1100010110010… |
… | …1111111110000 |
3 | 10121110121111110 |
4 | 3011211333300 |
5 | 101230014000 |
6 | 5050113320 |
7 | 1166163402 |
oct | 305457760 |
9 | 117417443 |
10 | 51798000 |
11 | 27269671 |
12 | 1541b840 |
13 | a967907 |
14 | 6c44b72 |
15 | 4832850 |
hex | 3165ff0 |
51798000 has 160 divisors (see below), whose sum is σ = 170614080. Its totient is φ = 13516800.
The previous prime is 51797981. The next prime is 51798007. The reversal of 51798000 is 89715.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51798007) 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, 533952 + ... + 534048.
It is an arithmetic number, because the mean of its divisors is an integer number (1066338).
Almost surely, 251798000 is an apocalyptic number.
51798000 is a gapful number since it is divisible by the number (50) 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 51798000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (85307040).
51798000 is an abundant number, since it is smaller than the sum of its proper divisors (118816080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51798000 is a wasteful number, since it uses less digits than its factorization.
51798000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 212 (or 196 counting only the distinct ones).
The product of its (nonzero) digits is 2520, while the sum is 30.
The square root of 51798000 is about 7197.0827423339. The cubic root of 51798000 is about 372.7671761580.
The spelling of 51798000 in words is "fifty-one million, seven hundred ninety-eight thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •