Search a number
-
+
11153515469 is a prime number
BaseRepresentation
bin10100110001100110…
…10010001111001101
31001210022022021212112
422120303102033031
5140320244443334
65042430313405
7543252213545
oct123063221715
931708267775
1011153515469
114803961288
1221b3358865
1310899876c5
1477b432325
154542b54ce
hex298cd23cd

11153515469 has 2 divisors, whose sum is σ = 11153515470. Its totient is φ = 11153515468.

The previous prime is 11153515463. The next prime is 11153515561. The reversal of 11153515469 is 96451535111.

11153515469 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 9403180900 + 1750334569 = 96970^2 + 41837^2 .

It is a cyclic number.

It is not a de Polignac number, because 11153515469 - 28 = 11153515213 is a prime.

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 211153515469 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 81000, while the sum is 41.

The spelling of 11153515469 in words is "eleven billion, one hundred fifty-three million, five hundred fifteen thousand, four hundred sixty-nine".