Base | Representation |
---|---|
bin | 1100001100110… |
… | …0110110010000 |
3 | 10120021202000021 |
4 | 3003030312100 |
5 | 101044430304 |
6 | 5024433224 |
7 | 1160641504 |
oct | 303146620 |
9 | 116252007 |
10 | 51170704 |
11 | 26980342 |
12 | 15178814 |
13 | a7a8230 |
14 | 6b20304 |
15 | 475ba54 |
hex | 30ccd90 |
51170704 has 80 divisors (see below), whose sum is σ = 112475440. Its totient is φ = 22394880.
The previous prime is 51170689. The next prime is 51170711. The reversal of 51170704 is 40707115.
It can be written as a sum of positive squares in 8 ways, for example, as 1440000 + 49730704 = 1200^2 + 7052^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 469402 + ... + 469510.
It is an arithmetic number, because the mean of its divisors is an integer number (1405943).
Almost surely, 251170704 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 51170704, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (56237720).
51170704 is an abundant number, since it is smaller than the sum of its proper divisors (61304736).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51170704 is a wasteful number, since it uses less digits than its factorization.
51170704 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 228 (or 222 counting only the distinct ones).
The product of its (nonzero) digits is 980, while the sum is 25.
The square root of 51170704 is about 7153.3701148480. The cubic root of 51170704 is about 371.2562702671.
Adding to 51170704 its reverse (40707115), we get a palindrome (91877819).
The spelling of 51170704 in words is "fifty-one million, one hundred seventy thousand, seven hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.150 sec. • engine limits •