Search a number
-
+
117051551 is a prime number
BaseRepresentation
bin1101111101000…
…01000010011111
322011020211112122
412332201002133
5214431122201
615340453155
72620631111
oct676410237
9264224478
10117051551
1160088621
123324a1bb
131b333b96
141178d3b1
15a421e1b
hex6fa109f

117051551 has 2 divisors, whose sum is σ = 117051552. Its totient is φ = 117051550.

The previous prime is 117051521. The next prime is 117051559. The reversal of 117051551 is 155150711.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 117051551 - 214 = 117035167 is a prime.

It is a Chen prime.

It is a self number, because there is not a number n which added to its sum of digits gives 117051551.

It is a congruent number.

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

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

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

Almost surely, 2117051551 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 875, while the sum is 26.

The square root of 117051551 is about 10819.0365097822. The cubic root of 117051551 is about 489.1691473119.

The spelling of 117051551 in words is "one hundred seventeen million, fifty-one thousand, five hundred fifty-one".