Base | Representation |
---|---|
bin | 1100010100101… |
… | …1010000111011 |
3 | 10121021001022011 |
4 | 3011023100323 |
5 | 101213013012 |
6 | 5043510351 |
7 | 1165226233 |
oct | 305132073 |
9 | 117231264 |
10 | 51688507 |
11 | 271a4382 |
12 | 153883b7 |
13 | a929b20 |
14 | 6c16cc3 |
15 | 48101a7 |
hex | 314b43b |
51688507 has 8 divisors (see below), whose sum is σ = 55846784. Its totient is φ = 47556288.
The previous prime is 51688471. The next prime is 51688513. The reversal of 51688507 is 70588615.
51688507 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 51688507 - 223 = 43299899 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 51688507.
It is not an unprimeable number, because it can be changed into a prime (51688807) 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, 2283 + ... + 10420.
It is an arithmetic number, because the mean of its divisors is an integer number (6980848).
Almost surely, 251688507 is an apocalyptic number.
51688507 is a deficient number, since it is larger than the sum of its proper divisors (4158277).
51688507 is a wasteful number, since it uses less digits than its factorization.
51688507 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13029.
The product of its (nonzero) digits is 67200, while the sum is 40.
The square root of 51688507 is about 7189.4719555750. The cubic root of 51688507 is about 372.5043333880.
The spelling of 51688507 in words is "fifty-one million, six hundred eighty-eight thousand, five hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •