Search a number
-
+
115550670569 is a prime number
BaseRepresentation
bin110101110011101011…
…0110100111011101001
3102001020220222020221112
41223213112310323221
53343121432424234
6125025551520105
711230311331325
oct1534726647351
9361226866845
10115550670569
1145006383064
121a489829035
13ab86472269
14584246a985
153014575ace
hex1ae75b4ee9

115550670569 has 2 divisors, whose sum is σ = 115550670570. Its totient is φ = 115550670568.

The previous prime is 115550670511. The next prime is 115550670583. The reversal of 115550670569 is 965076055511.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 95010048169 + 20540622400 = 308237^2 + 143320^2 .

It is a cyclic number.

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

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

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

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

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

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

Almost surely, 2115550670569 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1417500, while the sum is 50.

The spelling of 115550670569 in words is "one hundred fifteen billion, five hundred fifty million, six hundred seventy thousand, five hundred sixty-nine".