Search a number
-
+
1052122567 is a prime number
BaseRepresentation
bin111110101101100…
…001110111000111
32201022202100211111
4332231201313013
54123320410232
6252222345451
735033615506
oct7655416707
92638670744
101052122567
1149a994291
1225442b287
13139c89742
149da3883d
156257a047
hex3eb61dc7

1052122567 has 2 divisors, whose sum is σ = 1052122568. Its totient is φ = 1052122566.

The previous prime is 1052122559. The next prime is 1052122583. The reversal of 1052122567 is 7652212501.

It is a weak prime.

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

It is a cyclic number.

It is not a de Polignac number, because 1052122567 - 23 = 1052122559 is a prime.

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

It is a congruent number.

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

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

Almost surely, 21052122567 is an apocalyptic number.

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

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

1052122567 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 31.

The square root of 1052122567 is about 32436.4388766708. The cubic root of 1052122567 is about 1017.0807750035.

The spelling of 1052122567 in words is "one billion, fifty-two million, one hundred twenty-two thousand, five hundred sixty-seven".