Search a number
-
+
116029141 is a prime number
BaseRepresentation
bin1101110101001…
…11011011010101
322002022220001121
412322213123111
5214200413031
615302523541
72606142244
oct672473325
9262286047
10116029141
115a54a458
1232a365b1
131b0666c7
14115a495b
15a2be011
hex6ea76d5

116029141 has 2 divisors, whose sum is σ = 116029142. Its totient is φ = 116029140.

The previous prime is 116029127. The next prime is 116029153. The reversal of 116029141 is 141920611.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 114041041 + 1988100 = 10679^2 + 1410^2 .

It is a cyclic number.

It is not a de Polignac number, because 116029141 - 27 = 116029013 is a prime.

It is a super-2 number, since 2×1160291412 = 26925523122395762, which contains 22 as substring.

It is a congruent number.

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

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

Almost surely, 2116029141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 432, while the sum is 25.

The square root of 116029141 is about 10771.6823662787. The cubic root of 116029141 is about 487.7407319485.

Adding to 116029141 its reverse (141920611), we get a palindrome (257949752).

The spelling of 116029141 in words is "one hundred sixteen million, twenty-nine thousand, one hundred forty-one".