Search a number
-
+
10522630609 is a prime number
BaseRepresentation
bin10011100110011001…
…01001100111010001
31000011100012000112121
421303030221213101
5133022243134414
64500052254241
7521521612231
oct116314514721
930140160477
1010522630609
11450a829137
122058011381
13cb906715a
1471b729cc1
15418be6724
hex2733299d1

10522630609 has 2 divisors, whose sum is σ = 10522630610. Its totient is φ = 10522630608.

The previous prime is 10522630567. The next prime is 10522630639. The reversal of 10522630609 is 90603622501.

10522630609 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10505225025 + 17405584 = 102495^2 + 4172^2 .

It is a cyclic number.

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

It is a super-2 number, since 2×105226306092 (a number of 21 digits) contains 22 as substring.

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

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

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

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

Almost surely, 210522630609 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 19440, while the sum is 34.

The spelling of 10522630609 in words is "ten billion, five hundred twenty-two million, six hundred thirty thousand, six hundred nine".