Search a number
-
+
116781104261 is a prime number
BaseRepresentation
bin110110011000010110…
…0100011110010000101
3102011102200020202122202
41230300230203302011
53403131430314021
6125352024204245
711302642002503
oct1546054436205
9364380222582
10116781104261
1145587986108
121a771909685
13b021360c33
14591ba3d673
1530875c3a0b
hex1b30b23c85

116781104261 has 2 divisors, whose sum is σ = 116781104262. Its totient is φ = 116781104260.

The previous prime is 116781104227. The next prime is 116781104263. The reversal of 116781104261 is 162401187611.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 90006000100 + 26775104161 = 300010^2 + 163631^2 .

It is a cyclic number.

It is not a de Polignac number, because 116781104261 - 26 = 116781104197 is a prime.

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

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

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

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

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

Almost surely, 2116781104261 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 16128, while the sum is 38.

The spelling of 116781104261 in words is "one hundred sixteen billion, seven hundred eighty-one million, one hundred four thousand, two hundred sixty-one".