Search a number
-
+
116141055302 = 2211572744743
BaseRepresentation
bin110110000101010001…
…0111101110101000110
3102002210001212220112202
41230022202331311012
53400324102232202
6125204321514502
711251040452526
oct1541242756506
9362701786482
10116141055302
1145289663928
121a6134a2a32
13ac4b88243c
14589aa2d686
15304b2e4802
hex1b0a8bdd46

116141055302 has 8 divisors (see below), whose sum is σ = 174219880656. Its totient is φ = 58067761752.

The previous prime is 116141055263. The next prime is 116141055343. The reversal of 116141055302 is 203550141611.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a super-2 number, since 2×1161410553022 (a number of 23 digits) contains 22 as substring.

It is a congruent number.

It is an unprimeable number.

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 3 ways as a sum of consecutive naturals, for example, 1330058 + ... + 1414685.

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

Almost surely, 2116141055302 is an apocalyptic number.

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

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

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

The sum of its prime factors is 2765902.

The product of its (nonzero) digits is 3600, while the sum is 29.

Adding to 116141055302 its reverse (203550141611), we get a palindrome (319691196913).

The spelling of 116141055302 in words is "one hundred sixteen billion, one hundred forty-one million, fifty-five thousand, three hundred two".

Divisors: 1 2 21157 42314 2744743 5489486 58070527651 116141055302