Search a number
-
+
1052185307 is a prime number
BaseRepresentation
bin111110101101110…
…001001011011011
32201022212112220012
4332231301023123
54123324412212
6252223552135
735034266435
oct7655611333
92638775805
101052185307
1149aa27438
1225445b64b
13139cac174
149da53655
156258d922
hex3eb712db

1052185307 has 2 divisors, whose sum is σ = 1052185308. Its totient is φ = 1052185306.

The previous prime is 1052185271. The next prime is 1052185339. The reversal of 1052185307 is 7035812501.

It is an a-pointer prime, because the next prime (1052185339) can be obtained adding 1052185307 to its sum of digits (32).

It is a strong prime.

It is an emirp because it is prime and its reverse (7035812501) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 1052185307 - 210 = 1052184283 is a prime.

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

It is not a weakly prime, because it can be changed into another prime (1052185367) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 526092653 + 526092654.

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

Almost surely, 21052185307 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 8400, while the sum is 32.

The square root of 1052185307 is about 32437.4059844495. The cubic root of 1052185307 is about 1017.1009913996.

Adding to 1052185307 its reverse (7035812501), we get a palindrome (8087997808).

The spelling of 1052185307 in words is "one billion, fifty-two million, one hundred eighty-five thousand, three hundred seven".