Search a number
-
+
116902666913 is a prime number
BaseRepresentation
bin110110011011111110…
…0010010001010100001
3102011202010222210021012
41230313330102022201
53403404040320123
6125412045510305
711305646162534
oct1546774221241
9364663883235
10116902666913
114563a564a0a
121a7a6572395
13b0405b41b6
14592dc44a1b
1530930d7378
hex1b37f122a1

116902666913 has 2 divisors, whose sum is σ = 116902666914. Its totient is φ = 116902666912.

The previous prime is 116902666891. The next prime is 116902666931. The reversal of 116902666913 is 319666209611.

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

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 113553498529 + 3349168384 = 336977^2 + 57872^2 .

It is a cyclic number.

It is not a de Polignac number, because 116902666913 - 26 = 116902666849 is a prime.

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

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

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

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

Almost surely, 2116902666913 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 629856, while the sum is 50.

The spelling of 116902666913 in words is "one hundred sixteen billion, nine hundred two million, six hundred sixty-six thousand, nine hundred thirteen".