Search a number
-
+
117236556035567 is a prime number
BaseRepresentation
bin11010101010000001000011…
…010001101111010111101111
3120101002201001011102110102222
4122222001003101233113233
5110331300431321114232
61053201421430105555
733460030102101203
oct3252010321572757
9511081034373388
10117236556035567
113439a820593281
12111952914ab2bb
13505548a621517
1420d43cb292b03
15d848d282dd12
hex6aa04346f5ef

117236556035567 has 2 divisors, whose sum is σ = 117236556035568. Its totient is φ = 117236556035566.

The previous prime is 117236556035527. The next prime is 117236556035569. The reversal of 117236556035567 is 765530655632711.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 117236556035567 - 28 = 117236556035311 is a prime.

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

Together with 117236556035569, 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 (117236556035569) by changing a digit.

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

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

Almost surely, 2117236556035567 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 119070000, while the sum is 62.

The spelling of 117236556035567 in words is "one hundred seventeen trillion, two hundred thirty-six billion, five hundred fifty-six million, thirty-five thousand, five hundred sixty-seven".