Search a number
-
+
1247266049 is a prime number
BaseRepresentation
bin100101001010111…
…1100010100000001
310012220221200100212
41022111330110001
510023300003144
6323433123505
742623405111
oct11225742401
93186850325
101247266049
1159005a497
122a9859595
1316b533363
14bb915041
157477549e
hex4a57c501

1247266049 has 2 divisors, whose sum is σ = 1247266050. Its totient is φ = 1247266048.

The previous prime is 1247266019. The next prime is 1247266051. The reversal of 1247266049 is 9406627421.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 806560000 + 440706049 = 28400^2 + 20993^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-1247266049 is a prime.

It is a Sophie Germain prime.

Together with 1247266051, it forms a pair of twin primes.

It is a Chen prime.

It is a Curzon number.

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

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

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

Almost surely, 21247266049 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 145152, while the sum is 41.

The square root of 1247266049 is about 35316.6539893009. The cubic root of 1247266049 is about 1076.4314225742.

The spelling of 1247266049 in words is "one billion, two hundred forty-seven million, two hundred sixty-six thousand, forty-nine".