Base | Representation |
---|---|
bin | 1100001100000… |
… | …1110111101101 |
3 | 10120012110022222 |
4 | 3003001313231 |
5 | 101042010431 |
6 | 5023445125 |
7 | 1160363432 |
oct | 303016755 |
9 | 116173288 |
10 | 51125741 |
11 | 2694a587 |
12 | 151567a5 |
13 | a790924 |
14 | 6b0bb89 |
15 | 474d57b |
hex | 30c1ded |
51125741 has 2 divisors, whose sum is σ = 51125742. Its totient is φ = 51125740.
The previous prime is 51125717. The next prime is 51125743. The reversal of 51125741 is 14752115.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 36844900 + 14280841 = 6070^2 + 3779^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-51125741 is a prime.
It is a super-2 number, since 2×511257412 = 5227682785598162, which contains 22 as substring.
Together with 51125743, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 51125741.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (51125743) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25562870 + 25562871.
It is an arithmetic number, because the mean of its divisors is an integer number (25562871).
Almost surely, 251125741 is an apocalyptic number.
It is an amenable number.
51125741 is a deficient number, since it is larger than the sum of its proper divisors (1).
51125741 is an equidigital number, since it uses as much as digits as its factorization.
51125741 is an evil number, because the sum of its binary digits is even.
The product of its digits is 1400, while the sum is 26.
The square root of 51125741 is about 7150.2266397646. The cubic root of 51125741 is about 371.1474991279.
Adding to 51125741 its reverse (14752115), we get a palindrome (65877856).
The spelling of 51125741 in words is "fifty-one million, one hundred twenty-five thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •