Base | Representation |
---|---|
bin | 1100010110000… |
… | …0100101101001 |
3 | 10121102111010001 |
4 | 3011200211221 |
5 | 101223311344 |
6 | 5045423001 |
7 | 1166041666 |
oct | 305404551 |
9 | 117374101 |
10 | 51775849 |
11 | 27253a64 |
12 | 1540aa61 |
13 | a95a7c8 |
14 | 6c3aa6d |
15 | 482aed4 |
hex | 3160969 |
51775849 has 2 divisors, whose sum is σ = 51775850. Its totient is φ = 51775848.
The previous prime is 51775847. The next prime is 51775873. The reversal of 51775849 is 94857715.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 32035600 + 19740249 = 5660^2 + 4443^2 .
It is a cyclic number.
It is not a de Polignac number, because 51775849 - 21 = 51775847 is a prime.
Together with 51775847, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 51775799 and 51775808.
It is not a weakly prime, because it can be changed into another prime (51775847) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25887924 + 25887925.
It is an arithmetic number, because the mean of its divisors is an integer number (25887925).
Almost surely, 251775849 is an apocalyptic number.
It is an amenable number.
51775849 is a deficient number, since it is larger than the sum of its proper divisors (1).
51775849 is an equidigital number, since it uses as much as digits as its factorization.
51775849 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 352800, while the sum is 46.
The square root of 51775849 is about 7195.5436903684. The cubic root of 51775849 is about 372.7140316155.
It can be divided in two parts, 5177 and 5849, that added together give a triangular number (11026 = T148).
The spelling of 51775849 in words is "fifty-one million, seven hundred seventy-five thousand, eight hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •