Search a number
-
+
11355545231 is a prime number
BaseRepresentation
bin10101001001101011…
…11101111010001111
31002022101110110121022
422210311331322033
5141224004421411
65114444424355
7551254353602
oct124465757217
932271413538
1011355545231
1148a7a00228
12224ab480bb
1310bc7a2844
1479a1c2339
15466dc0edb
hex2a4d7de8f

11355545231 has 2 divisors, whose sum is σ = 11355545232. Its totient is φ = 11355545230.

The previous prime is 11355545213. The next prime is 11355545249. The reversal of 11355545231 is 13254555311.

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

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

It is a cyclic number.

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

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

It is a Sophie Germain prime.

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

It is a congruent number.

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

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

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

Almost surely, 211355545231 is an apocalyptic number.

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

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

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

The product of its digits is 45000, while the sum is 35.

The spelling of 11355545231 in words is "eleven billion, three hundred fifty-five million, five hundred forty-five thousand, two hundred thirty-one".