Base | Representation |
---|---|
bin | 1100010011011… |
… | …1001000111001 |
3 | 10121002212020001 |
4 | 3010313020321 |
5 | 101202343243 |
6 | 5042033001 |
7 | 1164434011 |
oct | 304671071 |
9 | 117085201 |
10 | 51606073 |
11 | 27148452 |
12 | 15348761 |
13 | a8cb44c |
14 | 6bd4c41 |
15 | 47e5a4d |
hex | 3137239 |
51606073 has 8 divisors (see below), whose sum is σ = 52200000. Its totient is φ = 51015888.
The previous prime is 51606059. The next prime is 51606127. The reversal of 51606073 is 37060615.
51606073 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 not a de Polignac number, because 51606073 - 213 = 51597881 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (51606473) 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, 33678 + ... + 35176.
It is an arithmetic number, because the mean of its divisors is an integer number (6525000).
Almost surely, 251606073 is an apocalyptic number.
It is an amenable number.
51606073 is a deficient number, since it is larger than the sum of its proper divisors (593927).
51606073 is a wasteful number, since it uses less digits than its factorization.
51606073 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1871.
The product of its (nonzero) digits is 3780, while the sum is 28.
The square root of 51606073 is about 7183.7367017451. The cubic root of 51606073 is about 372.3062019105.
Adding to 51606073 its reverse (37060615), we get a palindrome (88666688).
The spelling of 51606073 in words is "fifty-one million, six hundred six thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •