Search a number
-
+
116110016613 = 3212901112957
BaseRepresentation
bin110110000100010110…
…0100100000001100101
3102002200220110222110200
41230020230210001211
53400243131012423
6125201252341113
711250212566653
oct1541054440145
9362626428420
10116110016613
1145273094018
121a605014799
13ac45305756
14589686ddd3
153048712d43
hex1b08b24065

116110016613 has 6 divisors (see below), whose sum is σ = 167714468454. Its totient is φ = 77406677736.

The previous prime is 116110016611. The next prime is 116110016651. The reversal of 116110016613 is 316610011611.

It can be written as a sum of positive squares in only one way, i.e., 87735624804 + 28374391809 = 296202^2 + 168447^2 .

It is not a de Polignac number, because 116110016613 - 21 = 116110016611 is a prime.

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

It is a congruent number.

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

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 6450556470 + ... + 6450556487.

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

Almost surely, 2116110016613 is an apocalyptic number.

It is an amenable number.

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

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

116110016613 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 12901112963 (or 12901112960 counting only the distinct ones).

The product of its (nonzero) digits is 648, while the sum is 27.

The spelling of 116110016613 in words is "one hundred sixteen billion, one hundred ten million, sixteen thousand, six hundred thirteen".

Divisors: 1 3 9 12901112957 38703338871 116110016613