Search a number
-
+
115706930947 = 418336792647
BaseRepresentation
bin110101111000010101…
…0111010011100000011
3102001122211000002212221
41223300222322130003
53343431433242242
6125053253031511
711234216454046
oct1536052723403
9361584002787
10115706930947
1145086600873
121a512025597
13abac95381a
145859104c5d
153023140167
hex1af0aba703

115706930947 has 16 divisors (see below), whose sum is σ = 120285268992. Its totient is φ = 111219670080.

The previous prime is 115706930939. The next prime is 115706930953. The reversal of 115706930947 is 749039607511.

It is not a de Polignac number, because 115706930947 - 23 = 115706930939 is a prime.

It is a Duffinian number.

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

It is not an unprimeable number, because it can be changed into a prime (115706930917) 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, 1202578 + ... + 1295224.

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

Almost surely, 2115706930947 is an apocalyptic number.

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

115706930947 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 93138.

The product of its (nonzero) digits is 1428840, while the sum is 52.

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

Divisors: 1 41 83 367 3403 15047 30461 92647 1248901 3798527 7689701 34001449 315277741 1394059409 2822120267 115706930947