Search a number
-
+
116960047 is a prime number
BaseRepresentation
bin1101111100010…
…10101100101111
322011002012000121
412332022230233
5214420210142
615334505411
72620100251
oct676125457
9264065017
10116960047
11600258a6
1233205267
131b301339
1411767cd1
15a404c67
hex6f8ab2f

116960047 has 2 divisors, whose sum is σ = 116960048. Its totient is φ = 116960046.

The previous prime is 116959963. The next prime is 116960057. The reversal of 116960047 is 740069611.

It is a strong prime.

It is an emirp because it is prime and its reverse (740069611) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 116960047 - 223 = 108571439 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 116959994 and 116960021.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (116960057) 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, 58480023 + 58480024.

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

Almost surely, 2116960047 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 9072, while the sum is 34.

The square root of 116960047 is about 10814.8068406236. The cubic root of 116960047 is about 489.0416462175.

It can be divided in two parts, 1169 and 60047, that added together give a palindrome (61216).

The spelling of 116960047 in words is "one hundred sixteen million, nine hundred sixty thousand, forty-seven".