Base | Representation |
---|---|
bin | 1100011000000… |
… | …1110001000100 |
3 | 10121200101112100 |
4 | 3012001301010 |
5 | 101242133443 |
6 | 5052352100 |
7 | 1200146130 |
oct | 306016104 |
9 | 117611470 |
10 | 51911748 |
11 | 27337079 |
12 | 15475630 |
13 | a9a7615 |
14 | 6c743c0 |
15 | 48563d3 |
hex | 3181c44 |
51911748 has 72 divisors (see below), whose sum is σ = 151377408. Its totient is φ = 14692608.
The previous prime is 51911747. The next prime is 51911753. The reversal of 51911748 is 84711915.
It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.
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 (51911747) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 27565 + ... + 29387.
It is an arithmetic number, because the mean of its divisors is an integer number (2102464).
Almost surely, 251911748 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 51911748, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (75688704).
51911748 is an abundant number, since it is smaller than the sum of its proper divisors (99465660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51911748 is a wasteful number, since it uses less digits than its factorization.
51911748 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1953 (or 1948 counting only the distinct ones).
The product of its digits is 10080, while the sum is 36.
The square root of 51911748 is about 7204.9807772124. The cubic root of 51911748 is about 373.0398412594.
The spelling of 51911748 in words is "fifty-one million, nine hundred eleven thousand, seven hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •