Search a number
-
+
11439627569 is a prime number
BaseRepresentation
bin10101010011101101…
…01101110100110001
31002112020200021212222
422221312231310301
5141412021040234
65131050530425
7553325141606
oct125166556461
932466607788
1011439627569
11494040a567
122273136a15
1311040320c6
147a742c6ad
1546e47e42e
hex2a9dadd31

11439627569 has 2 divisors, whose sum is σ = 11439627570. Its totient is φ = 11439627568.

The previous prime is 11439627527. The next prime is 11439627611. The reversal of 11439627569 is 96572693411.

It is a balanced prime because it is at equal distance from previous prime (11439627527) and next prime (11439627611).

It can be written as a sum of positive squares in only one way, i.e., 10714941169 + 724686400 = 103513^2 + 26920^2 .

It is a cyclic number.

It is not a de Polignac number, because 11439627569 - 28 = 11439627313 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 11439627569.

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

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

Almost surely, 211439627569 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 2449440, while the sum is 53.

The spelling of 11439627569 in words is "eleven billion, four hundred thirty-nine million, six hundred twenty-seven thousand, five hundred sixty-nine".