Search a number
-
+
11164531531 is a prime number
BaseRepresentation
bin10100110010111010…
…10011101101001011
31001211002000222001211
422121131103231023
5140331110002111
65043502353551
7543444644416
oct123135235513
931732028054
1011164531531
11480a0a586a
1221b6b8b8b7
13108c04389a
1477ca9cb7d
1545523e521
hex299753b4b

11164531531 has 2 divisors, whose sum is σ = 11164531532. Its totient is φ = 11164531530.

The previous prime is 11164531513. The next prime is 11164531541. The reversal of 11164531531 is 13513546111.

Together with previous prime (11164531513) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 11164531531 - 29 = 11164531019 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 11164531493 and 11164531502.

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

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

Almost surely, 211164531531 is an apocalyptic number.

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

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

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

The product of its digits is 5400, while the sum is 31.

The spelling of 11164531531 in words is "eleven billion, one hundred sixty-four million, five hundred thirty-one thousand, five hundred thirty-one".