Search a number
-
+
1115151197 is a prime number
BaseRepresentation
bin100001001110111…
…1101101101011101
32212201100112212012
41002131331231131
54240434314242
6302353321005
736430425446
oct10235755535
92781315765
101115151197
11522523666
12271566165
1314a0570a4
14a81642cd
1567d7a282
hex4277db5d

1115151197 has 2 divisors, whose sum is σ = 1115151198. Its totient is φ = 1115151196.

The previous prime is 1115151151. The next prime is 1115151199. The reversal of 1115151197 is 7911515111.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 597998116 + 517153081 = 24454^2 + 22741^2 .

It is an emirp because it is prime and its reverse (7911515111) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 1115151197 - 26 = 1115151133 is a prime.

Together with 1115151199, it forms a pair of twin primes.

It is a Chen prime.

It is a congruent number.

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

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

Almost surely, 21115151197 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 1575, while the sum is 32.

The square root of 1115151197 is about 33393.8796338491. The cubic root of 1115151197 is about 1036.9979988226.

The spelling of 1115151197 in words is "one billion, one hundred fifteen million, one hundred fifty-one thousand, one hundred ninety-seven".