Search a number
-
+
11172567361 is a prime number
BaseRepresentation
bin10100110011110111…
…11101100101000001
31001211122011020011011
422121323331211001
5140340134123421
65044350520521
7543603153454
oct123173754501
931748136134
1011172567361
11481369424a
1221b9806141
1310908c8407
1477db9149b
15455cca4e1
hex299efd941

11172567361 has 2 divisors, whose sum is σ = 11172567362. Its totient is φ = 11172567360.

The previous prime is 11172567299. The next prime is 11172567401. The reversal of 11172567361 is 16376527111.

It is an a-pointer prime, because the next prime (11172567401) can be obtained adding 11172567361 to its sum of digits (40).

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 9968824336 + 1203743025 = 99844^2 + 34695^2 .

It is a cyclic number.

It is not a de Polignac number, because 11172567361 - 233 = 2582632769 is a prime.

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

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

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

Almost surely, 211172567361 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 52920, while the sum is 40.

The spelling of 11172567361 in words is "eleven billion, one hundred seventy-two million, five hundred sixty-seven thousand, three hundred sixty-one".