Search a number
-
+
116315046235 = 5126041184567
BaseRepresentation
bin110110001010011101…
…0101100000101011011
3102010020012021120020101
41230110322230011123
53401203122434420
6125233455040231
711255252402653
oct1542472540533
9363205246211
10116315046235
11453688a1893
121a661810077
13ac7893115b
1458b5ba1363
15305b71260a
hex1b14eac15b

116315046235 has 8 divisors (see below), whose sum is σ = 139579919136. Its totient is φ = 93050794560.

The previous prime is 116315046187. The next prime is 116315046247. The reversal of 116315046235 is 532640513611.

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

It is not a de Polignac number, because 116315046235 - 211 = 116315044187 is a prime.

It is a Duffinian number.

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

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

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

Almost surely, 2116315046235 is an apocalyptic number.

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

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

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

The sum of its prime factors is 310613.

The product of its (nonzero) digits is 64800, while the sum is 37.

Adding to 116315046235 its reverse (532640513611), we get a palindrome (648955559846).

The spelling of 116315046235 in words is "one hundred sixteen billion, three hundred fifteen million, forty-six thousand, two hundred thirty-five".

Divisors: 1 5 126041 184567 630205 922835 23263009247 116315046235