Search a number
-
+
116413015035 = 3517299448631
BaseRepresentation
bin110110001101011000…
…0011010001111111011
3102010111000121220011110
41230122300122033323
53401403212440120
6125251314531403
711260552205202
oct1543260321773
9363430556143
10116413015035
1145409126239
121a68a596b63
13ac93013265
1458c4bc4239
1530651152e0
hex1b1ac1a3fb

116413015035 has 16 divisors (see below), whose sum is σ = 186272006400. Its totient is φ = 62083213920.

The previous prime is 116413015031. The next prime is 116413015087. The reversal of 116413015035 is 530510314611.

It is not a de Polignac number, because 116413015035 - 22 = 116413015031 is a prime.

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

It is not an unprimeable number, because it can be changed into a prime (116413015031) by changing a digit.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 35170 + ... + 483800.

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

Almost surely, 2116413015035 is an apocalyptic number.

116413015035 is a gapful number since it is divisible by the number (15) formed by its first and last digit.

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

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

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

The sum of its prime factors is 465938.

The product of its (nonzero) digits is 5400, while the sum is 30.

Adding to 116413015035 its reverse (530510314611), we get a palindrome (646923329646).

The spelling of 116413015035 in words is "one hundred sixteen billion, four hundred thirteen million, fifteen thousand, thirty-five".

Divisors: 1 3 5 15 17299 51897 86495 259485 448631 1345893 2243155 6729465 7760867669 23282603007 38804338345 116413015035