Base | Representation |
---|---|
bin | 1100010100111… |
… | …1101100100001 |
3 | 10121021222012101 |
4 | 3011033230201 |
5 | 101214103112 |
6 | 5044130401 |
7 | 1165333162 |
oct | 305175441 |
9 | 117258171 |
10 | 51706657 |
11 | 27206a82 |
12 | 15396a01 |
13 | a935172 |
14 | 6c1d769 |
15 | 4815757 |
hex | 314fb21 |
51706657 has 8 divisors (see below), whose sum is σ = 54929600. Its totient is φ = 48533904.
The previous prime is 51706651. The next prime is 51706663. The reversal of 51706657 is 75660715.
51706657 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (51706651) and next prime (51706663).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-51706657 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (51706651) 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 7 ways as a sum of consecutive naturals, for example, 10413 + ... + 14554.
It is an arithmetic number, because the mean of its divisors is an integer number (6866200).
Almost surely, 251706657 is an apocalyptic number.
It is an amenable number.
51706657 is a deficient number, since it is larger than the sum of its proper divisors (3222943).
51706657 is a wasteful number, since it uses less digits than its factorization.
51706657 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25095.
The product of its (nonzero) digits is 44100, while the sum is 37.
The square root of 51706657 is about 7190.7341071688. The cubic root of 51706657 is about 372.5479289108.
The spelling of 51706657 in words is "fifty-one million, seven hundred six thousand, six hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •