Search a number
-
+
51245251 = 69174161
BaseRepresentation
bin1100001101111…
…1000011000011
310120102112021021
43003133003003
5101104322001
65030210311
71161402031
oct303370303
9116375237
1051245251
1126a21352
12151b3997
13a803145
146b3d551
154773ba1
hex30df0c3

51245251 has 4 divisors (see below), whose sum is σ = 51320104. Its totient is φ = 51170400.

The previous prime is 51245237. The next prime is 51245273. The reversal of 51245251 is 15254215.

51245251 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 51245251 - 219 = 50720963 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (51275251) 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 in 3 ways as a sum of consecutive naturals, for example, 36390 + ... + 37771.

It is an arithmetic number, because the mean of its divisors is an integer number (12830026).

Almost surely, 251245251 is an apocalyptic number.

51245251 is a deficient number, since it is larger than the sum of its proper divisors (74853).

51245251 is an equidigital number, since it uses as much as digits as its factorization.

51245251 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 74852.

The product of its digits is 2000, while the sum is 25.

The square root of 51245251 is about 7158.5788394066. The cubic root of 51245251 is about 371.4364685064.

Adding to 51245251 its reverse (15254215), we get a palindrome (66499466).

The spelling of 51245251 in words is "fifty-one million, two hundred forty-five thousand, two hundred fifty-one".

Divisors: 1 691 74161 51245251