Search a number
-
+
116051660565 = 3519407198809
BaseRepresentation
bin110110000010100110…
…1111100111100010101
3102002112211200012000120
41230011031330330111
53400133211114230
6125151405502153
711245603560501
oct1540515747425
9362484605016
10116051660565
1145243156285
121a5a9571959
13ac361b2b49
14588cbdd301
153043537310
hex1b0537cf15

116051660565 has 16 divisors (see below), whose sum is σ = 195455428800. Its totient is φ = 58636628352.

The previous prime is 116051660503. The next prime is 116051660567. The reversal of 116051660565 is 565066150611.

It is not a de Polignac number, because 116051660565 - 210 = 116051659541 is a prime.

It is a super-2 number, since 2×1160516605652 (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 (116051660567) 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, 203599120 + ... + 203599689.

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

Almost surely, 2116051660565 is an apocalyptic number.

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

It is an amenable number.

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

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

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

The sum of its prime factors is 407198836.

The product of its (nonzero) digits is 162000, while the sum is 42.

The spelling of 116051660565 in words is "one hundred sixteen billion, fifty-one million, six hundred sixty thousand, five hundred sixty-five".

Divisors: 1 3 5 15 19 57 95 285 407198809 1221596427 2035994045 6107982135 7736777371 23210332113 38683886855 116051660565