Base | Representation |
---|---|
bin | 1100001100011… |
… | …1111011110100 |
3 | 10120020201101221 |
4 | 3003013323310 |
5 | 101043304310 |
6 | 5024200124 |
7 | 1160526025 |
oct | 303077364 |
9 | 116221357 |
10 | 51150580 |
11 | 26967208 |
12 | 15169044 |
13 | a79c020 |
14 | 6b16c4c |
15 | 4755ada |
hex | 30c7ef4 |
51150580 has 48 divisors (see below), whose sum is σ = 116769744. Its totient is φ = 18708480.
The previous prime is 51150571. The next prime is 51150587. The reversal of 51150580 is 8505115.
It can be written as a sum of positive squares in 8 ways, for example, as 34715664 + 16434916 = 5892^2 + 4054^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51150587) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 28510 + ... + 30250.
It is an arithmetic number, because the mean of its divisors is an integer number (2432703).
Almost surely, 251150580 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 51150580, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (58384872).
51150580 is an abundant number, since it is smaller than the sum of its proper divisors (65619164).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51150580 is a wasteful number, since it uses less digits than its factorization.
51150580 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1876 (or 1874 counting only the distinct ones).
The product of its (nonzero) digits is 1000, while the sum is 25.
The square root of 51150580 is about 7151.9633667966. The cubic root of 51150580 is about 371.2075956661.
Adding to 51150580 its reverse (8505115), we get a palindrome (59655695).
The spelling of 51150580 in words is "fifty-one million, one hundred fifty thousand, five hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •