Base | Representation |
---|---|
bin | 1100010011001… |
… | …0100001000101 |
3 | 10121001220020212 |
4 | 3010302201011 |
5 | 101201242031 |
6 | 5041405205 |
7 | 1164324554 |
oct | 304624105 |
9 | 117056225 |
10 | 51587141 |
11 | 27135201 |
12 | 15339805 |
13 | a8c2948 |
14 | 6bcbd9b |
15 | 47e012b |
hex | 3132845 |
51587141 has 2 divisors, whose sum is σ = 51587142. Its totient is φ = 51587140.
The previous prime is 51587117. The next prime is 51587189. The reversal of 51587141 is 14178515.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 36602500 + 14984641 = 6050^2 + 3871^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-51587141 is a prime.
It is a super-2 number, since 2×515871412 = 5322466233107762, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 51587098 and 51587107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (51587101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25793570 + 25793571.
It is an arithmetic number, because the mean of its divisors is an integer number (25793571).
Almost surely, 251587141 is an apocalyptic number.
It is an amenable number.
51587141 is a deficient number, since it is larger than the sum of its proper divisors (1).
51587141 is an equidigital number, since it uses as much as digits as its factorization.
51587141 is an evil number, because the sum of its binary digits is even.
The product of its digits is 5600, while the sum is 32.
The square root of 51587141 is about 7182.4188822429. The cubic root of 51587141 is about 372.2606687481.
The spelling of 51587141 in words is "fifty-one million, five hundred eighty-seven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •