Search a number
-
+
116915567 is a prime number
BaseRepresentation
bin1101111011111…
…11110101101111
322010222221000012
412331333311233
5214412244232
615333523435
72616523466
oct675776557
9263887005
10116915567
115aaa543a
12331a357b
131b2b7012
14117559dd
15a3e69b2
hex6f7fd6f

116915567 has 2 divisors, whose sum is σ = 116915568. Its totient is φ = 116915566.

The previous prime is 116915503. The next prime is 116915573. The reversal of 116915567 is 765519611.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 116915567 - 26 = 116915503 is a prime.

It is a Chen prime.

It is equal to p6675872 and since 116915567 and 6675872 have the same sum of digits, it is a Honaker prime.

It is a congruent number.

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

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

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

Almost surely, 2116915567 is an apocalyptic number.

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

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

116915567 is an evil number, because the sum of its binary digits is even.

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

The square root of 116915567 is about 10812.7502051976. The cubic root of 116915567 is about 488.9796440465.

The spelling of 116915567 in words is "one hundred sixteen million, nine hundred fifteen thousand, five hundred sixty-seven".