Search a number
-
+
516426049 is a prime number
BaseRepresentation
bin11110110010000…
…000100101000001
31022222202011100201
4132302000211001
52024201113144
6123124445201
715540356206
oct3662004501
91288664321
10516426049
11245566597
12124b49801
1382cb6859
144c82dcad
15305101d4
hex1ec80941

516426049 has 2 divisors, whose sum is σ = 516426050. Its totient is φ = 516426048.

The previous prime is 516426019. The next prime is 516426059. The reversal of 516426049 is 940624615.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 296941824 + 219484225 = 17232^2 + 14815^2 .

It is a cyclic number.

It is not a de Polignac number, because 516426049 - 29 = 516425537 is a prime.

It is a super-3 number, since 3×5164260493 (a number of 27 digits) contains 333 as substring.

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

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

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

Almost surely, 2516426049 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 51840, while the sum is 37.

The square root of 516426049 is about 22725.0093289310. The cubic root of 516426049 is about 802.2986229443.

It can be divided in two parts, 5164 and 26049, that added together give a palindrome (31213).

The spelling of 516426049 in words is "five hundred sixteen million, four hundred twenty-six thousand, forty-nine".