Base | Representation |
---|---|
bin | 1100001010110… |
… | …1000100111101 |
3 | 10120001010111121 |
4 | 3002231010331 |
5 | 101031244243 |
6 | 5021550541 |
7 | 1156560223 |
oct | 302550475 |
9 | 116033447 |
10 | 51040573 |
11 | 268a15a1 |
12 | 15115451 |
13 | a760c2c |
14 | 6ac8b13 |
15 | 47331ed |
hex | 30ad13d |
51040573 has 2 divisors, whose sum is σ = 51040574. Its totient is φ = 51040572.
The previous prime is 51040547. The next prime is 51040589. The reversal of 51040573 is 37504015.
51040573 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 30492484 + 20548089 = 5522^2 + 4533^2 .
It is a cyclic number.
It is not a de Polignac number, because 51040573 - 25 = 51040541 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (51040373) 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 as a sum of consecutive naturals, namely, 25520286 + 25520287.
It is an arithmetic number, because the mean of its divisors is an integer number (25520287).
Almost surely, 251040573 is an apocalyptic number.
It is an amenable number.
51040573 is a deficient number, since it is larger than the sum of its proper divisors (1).
51040573 is an equidigital number, since it uses as much as digits as its factorization.
51040573 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2100, while the sum is 25.
The square root of 51040573 is about 7144.2685419852. The cubic root of 51040573 is about 370.9412921153.
Adding to 51040573 its reverse (37504015), we get a palindrome (88544588).
The spelling of 51040573 in words is "fifty-one million, forty thousand, five hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •