Base | Representation |
---|---|
bin | 1100010010100… |
… | …0011011111001 |
3 | 10120222210121112 |
4 | 3010220123321 |
5 | 101143431344 |
6 | 5040450105 |
7 | 1164063305 |
oct | 304503371 |
9 | 116883545 |
10 | 51545849 |
11 | 27107183 |
12 | 15319935 |
13 | a8a9c04 |
14 | 6bbad05 |
15 | 47d2c9e |
hex | 31286f9 |
51545849 has 2 divisors, whose sum is σ = 51545850. Its totient is φ = 51545848.
The previous prime is 51545831. The next prime is 51545873. The reversal of 51545849 is 94854515.
51545849 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 28697449 + 22848400 = 5357^2 + 4780^2 .
It is a cyclic number.
It is not a de Polignac number, because 51545849 - 212 = 51541753 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (51545899) 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, 25772924 + 25772925.
It is an arithmetic number, because the mean of its divisors is an integer number (25772925).
Almost surely, 251545849 is an apocalyptic number.
It is an amenable number.
51545849 is a deficient number, since it is larger than the sum of its proper divisors (1).
51545849 is an equidigital number, since it uses as much as digits as its factorization.
51545849 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 144000, while the sum is 41.
The square root of 51545849 is about 7179.5437877347. The cubic root of 51545849 is about 372.1613191149.
It can be divided in two parts, 515 and 45849, that added together give a palindrome (46364).
The spelling of 51545849 in words is "fifty-one million, five hundred forty-five thousand, eight hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •