Search a number
-
+
107736815147 = 13431210715919
BaseRepresentation
bin110010001010110011…
…1010101011000101011
3101022002100211021101212
41210111213111120223
53231121111041042
6121254341503335
710532550550613
oct1442547253053
9338070737355
10107736815147
1141766694905
1218a68a11b4b
13a20c674a80
1453007b9a43
152c08599482
hex19159d562b

107736815147 has 16 divisors (see below), whose sum is σ = 118739765760. Its totient is φ = 97122467232.

The previous prime is 107736815143. The next prime is 107736815177. The reversal of 107736815147 is 741518637701.

It is a cyclic number.

It is not a de Polignac number, because 107736815147 - 22 = 107736815143 is a prime.

It is a Duffinian number.

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

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

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

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

Almost surely, 2107736815147 is an apocalyptic number.

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

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

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

The sum of its prime factors is 28082.

The product of its (nonzero) digits is 987840, while the sum is 50.

The spelling of 107736815147 in words is "one hundred seven billion, seven hundred thirty-six million, eight hundred fifteen thousand, one hundred forty-seven".

Divisors: 1 13 43 559 12107 15919 157391 206947 520601 684517 6767813 8898721 192731333 2505507329 8287447319 107736815147