Search a number
-
+
116029151 = 7372831583
BaseRepresentation
bin1101110101001…
…11011011011111
322002022220001222
412322213123133
5214200413101
615302523555
72606142260
oct672473337
9262286058
10116029151
115a54a467
1232a365bb
131b066704
14115a4967
15a2be01b
hex6ea76df

116029151 has 16 divisors (see below), whose sum is σ = 136756224. Its totient is φ = 96362784.

The previous prime is 116029141. The next prime is 116029153. The reversal of 116029151 is 151920611.

It is not a de Polignac number, because 116029151 - 218 = 115767007 is a prime.

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 116029151.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (116029153) 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 in 15 ways as a sum of consecutive naturals, for example, 72506 + ... + 74088.

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

Almost surely, 2116029151 is an apocalyptic number.

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

116029151 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 1910.

The product of its (nonzero) digits is 540, while the sum is 26.

The square root of 116029151 is about 10771.6828304588. The cubic root of 116029151 is about 487.7407459606.

Adding to 116029151 its reverse (151920611), we get a palindrome (267949762).

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

Divisors: 1 7 37 259 283 1583 1981 10471 11081 58571 73297 409997 447989 3135923 16575593 116029151