Search a number
-
+
11581194269 is a prime number
BaseRepresentation
bin10101100100100101…
…10000000000011101
31002220010001121220002
422302102300000131
5142204241204034
65153105104045
7556664345531
oct126222600035
932803047802
1011581194269
114a03311737
1222b2628025
13112746a598
147bc15dbc1
1547bae4e7e
hex2b24b001d

11581194269 has 2 divisors, whose sum is σ = 11581194270. Its totient is φ = 11581194268.

The previous prime is 11581194199. The next prime is 11581194271. The reversal of 11581194269 is 96249118511.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 11485408900 + 95785369 = 107170^2 + 9787^2 .

It is a cyclic number.

It is not a de Polignac number, because 11581194269 - 220 = 11580145693 is a prime.

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

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

It is a Chen prime.

It is a congruent number.

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

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

Almost surely, 211581194269 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 155520, while the sum is 47.

The spelling of 11581194269 in words is "eleven billion, five hundred eighty-one million, one hundred ninety-four thousand, two hundred sixty-nine".