Base | Representation |
---|---|
bin | 110000000011111101… |
… | …110001001101100111 |
3 | 11221012112001002220220 |
4 | 300003331301031213 |
5 | 1321142132202214 |
6 | 35412454255423 |
7 | 3504563611023 |
oct | 600375611547 |
9 | 157175032826 |
10 | 51606131559 |
11 | 1a982352504 |
12 | a002957573 |
13 | 4b35741628 |
14 | 26d7b7d383 |
15 | 15208a59a9 |
hex | c03f71367 |
51606131559 has 8 divisors (see below), whose sum is σ = 68827181952. Its totient is φ = 34394584440.
The previous prime is 51606131539. The next prime is 51606131567. The reversal of 51606131559 is 95513160615.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 51606131559 - 27 = 51606131431 is a prime.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a self number, because there is not a number n which added to its sum of digits gives 51606131559.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51606131539) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2363137 + ... + 2384874.
It is an arithmetic number, because the mean of its divisors is an integer number (8603397744).
Almost surely, 251606131559 is an apocalyptic number.
51606131559 is a deficient number, since it is larger than the sum of its proper divisors (17221050393).
51606131559 is a wasteful number, since it uses less digits than its factorization.
51606131559 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4751637.
The product of its (nonzero) digits is 121500, while the sum is 42.
The spelling of 51606131559 in words is "fifty-one billion, six hundred six million, one hundred thirty-one thousand, five hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •