Search a number
-
+
5307116085737 = 17312183299161
BaseRepresentation
bin100110100111010100011…
…0001001110000111101001
3200210100121001012202122022
41031032220301032013221
51143422433204220422
615142015552034225
71055266166263244
oct115165061160751
920710531182568
105307116085737
11176680a746354
1271867a532975
132c65c728219b
14144c19a2225b
15930b49ca342
hex4d3a8c4e1e9

5307116085737 has 4 divisors (see below), whose sum is σ = 5619299384916. Its totient is φ = 4994932786560.

The previous prime is 5307116085673. The next prime is 5307116085779. The reversal of 5307116085737 is 7375806117035.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in 2 ways, for example, as 2330718235561 + 2976397850176 = 1526669^2 + 1725224^2 .

It is not a de Polignac number, because 5307116085737 - 26 = 5307116085673 is a prime.

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

It is a Duffinian number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 156091649564 + ... + 156091649597.

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

Almost surely, 25307116085737 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 312183299178.

The product of its (nonzero) digits is 3704400, while the sum is 53.

The spelling of 5307116085737 in words is "five trillion, three hundred seven billion, one hundred sixteen million, eighty-five thousand, seven hundred thirty-seven".

Divisors: 1 17 312183299161 5307116085737