Search a number
-
+
116943313 is a prime number
BaseRepresentation
bin1101111100001…
…10100111010001
322011001100001211
412332012213101
5214414141223
615334300121
72620000414
oct676064721
9264040054
10116943313
1160014273
12331b7641
131b2c6836
1411761b7b
15a3eed0d
hex6f869d1

116943313 has 2 divisors, whose sum is σ = 116943314. Its totient is φ = 116943312.

The previous prime is 116943311. The next prime is 116943331. The reversal of 116943313 is 313349611.

Together with next prime (116943331) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 64192144 + 52751169 = 8012^2 + 7263^2 .

It is a cyclic number.

It is not a de Polignac number, because 116943313 - 21 = 116943311 is a prime.

Together with 116943311, it forms a pair of twin primes.

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

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

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

Almost surely, 2116943313 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 5832, while the sum is 31.

The square root of 116943313 is about 10814.0331514195. The cubic root of 116943313 is about 489.0183219758.

The spelling of 116943313 in words is "one hundred sixteen million, nine hundred forty-three thousand, three hundred thirteen".