Search a number
-
+
51260519 is a prime number
BaseRepresentation
bin1100001110001…
…0110001100111
310120110022012202
43003202301213
5101110314034
65030405115
71161464402
oct303426147
9116408182
1051260519
1126a31872
121520079b
13a80a08b
146b44d39
15477847e
hex30e2c67

51260519 has 2 divisors, whose sum is σ = 51260520. Its totient is φ = 51260518.

The previous prime is 51260507. The next prime is 51260563. The reversal of 51260519 is 91506215.

51260519 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 is a cyclic number.

It is not a de Polignac number, because 51260519 - 224 = 34483303 is a prime.

It is a super-2 number, since 2×512605192 = 5255281616298722, which contains 22 as substring.

It is a Sophie Germain prime.

It is a Chen prime.

It is a junction number, because it is equal to n+sod(n) for n = 51260491 and 51260500.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (51260579) 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, 25630259 + 25630260.

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

Almost surely, 251260519 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 2700, while the sum is 29.

The square root of 51260519 is about 7159.6451727722. The cubic root of 51260519 is about 371.4733534129.

The spelling of 51260519 in words is "fifty-one million, two hundred sixty thousand, five hundred nineteen".