Base | Representation |
---|---|
bin | 1100001110101… |
… | …0011000110110 |
3 | 10120111212222200 |
4 | 3003222120312 |
5 | 101112313302 |
6 | 5031205330 |
7 | 1161654330 |
oct | 303523066 |
9 | 116455880 |
10 | 51291702 |
11 | 26a53240 |
12 | 15216846 |
13 | a81b327 |
14 | 6b52450 |
15 | 478281c |
hex | 30ea636 |
51291702 has 96 divisors (see below), whose sum is σ = 144668160. Its totient is φ = 12735360.
The previous prime is 51291683. The next prime is 51291707. The reversal of 51291702 is 20719215.
51291702 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51291707) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 31074 + ... + 32682.
It is an arithmetic number, because the mean of its divisors is an integer number (1506960).
Almost surely, 251291702 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 51291702, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (72334080).
51291702 is an abundant number, since it is smaller than the sum of its proper divisors (93376458).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51291702 is a wasteful number, since it uses less digits than its factorization.
51291702 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1658 (or 1655 counting only the distinct ones).
The product of its (nonzero) digits is 1260, while the sum is 27.
The square root of 51291702 is about 7161.8225334059. The cubic root of 51291702 is about 371.5486635198.
The spelling of 51291702 in words is "fifty-one million, two hundred ninety-one thousand, seven hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •