Search a number
-
+
11115925969 is a prime number
BaseRepresentation
bin10100101101000111…
…11001000111010001
31001200200120112202211
422112203321013101
5140231134112334
65035004512121
7542314545301
oct122643710721
931620515684
1011115925969
114794717785
1221a284b641
131081c560b5
14776449601
15450d3ca64
hex2968f91d1

11115925969 has 2 divisors, whose sum is σ = 11115925970. Its totient is φ = 11115925968.

The previous prime is 11115925957. The next prime is 11115925987. The reversal of 11115925969 is 96952951111.

11115925969 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., 7727289025 + 3388636944 = 87905^2 + 58212^2 .

It is a cyclic number.

It is not a de Polignac number, because 11115925969 - 27 = 11115925841 is a prime.

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

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

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

Almost surely, 211115925969 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 218700, while the sum is 49.

The spelling of 11115925969 in words is "eleven billion, one hundred fifteen million, nine hundred twenty-five thousand, nine hundred sixty-nine".