Base | Representation |
---|---|
bin | 1100010011010… |
… | …0101100101101 |
3 | 10121002100111211 |
4 | 3010310230231 |
5 | 101202033302 |
6 | 5041514421 |
7 | 1164362611 |
oct | 304645455 |
9 | 117070454 |
10 | 51596077 |
11 | 27140995 |
12 | 15342a11 |
13 | a8c6a30 |
14 | 6bd1341 |
15 | 47e2ad7 |
hex | 3134b2d |
51596077 has 8 divisors (see below), whose sum is σ = 58489760. Its totient is φ = 45120240.
The previous prime is 51596047. The next prime is 51596089. The reversal of 51596077 is 77069515.
51596077 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 a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-51596077 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51596047) 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, 104199 + ... + 104692.
It is an arithmetic number, because the mean of its divisors is an integer number (7311220).
Almost surely, 251596077 is an apocalyptic number.
It is an amenable number.
51596077 is a deficient number, since it is larger than the sum of its proper divisors (6893683).
51596077 is a wasteful number, since it uses less digits than its factorization.
51596077 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 208923.
The product of its (nonzero) digits is 66150, while the sum is 40.
The square root of 51596077 is about 7183.0409298569. The cubic root of 51596077 is about 372.2821620196.
It can be divided in two parts, 5159 and 6077, that added together give a square (11236 = 1062).
The spelling of 51596077 in words is "fifty-one million, five hundred ninety-six thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •