Base | Representation |
---|---|
bin | 1100011000111… |
… | …0000011010000 |
3 | 10121202221112220 |
4 | 3012032003100 |
5 | 101300241224 |
6 | 5053421040 |
7 | 1200445620 |
oct | 306160320 |
9 | 117687486 |
10 | 51962064 |
11 | 27370960 |
12 | 1549a780 |
13 | a9c44ab |
14 | 6c88880 |
15 | 4866279 |
hex | 318e0d0 |
51962064 has 160 divisors (see below), whose sum is σ = 177417216. Its totient is φ = 12687360.
The previous prime is 51962063. The next prime is 51962077. The reversal of 51962064 is 46026915.
51962064 = 8772 + 8782 + ... + 9392.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51962063) 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, 62419 + ... + 63245.
Almost surely, 251962064 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 51962064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (88708608).
51962064 is an abundant number, since it is smaller than the sum of its proper divisors (125455152).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51962064 is a wasteful number, since it uses less digits than its factorization.
51962064 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 873 (or 867 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 33.
The square root of 51962064 is about 7208.4716826800. The cubic root of 51962064 is about 373.1603265852.
Adding to 51962064 its reverse (46026915), we get a palindrome (97988979).
It can be divided in two parts, 5196 and 2064, that added together give a triangular number (7260 = T120).
The spelling of 51962064 in words is "fifty-one million, nine hundred sixty-two thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •