Search a number
-
+
115655065105 = 5157491468729
BaseRepresentation
bin110101110110110010…
…1000011111000010001
3102001112012102001022211
41223231211003320101
53343330144040410
6125044201232121
711233016555506
oct1535545037021
9361465361284
10115655065105
114505a2a6238
121a4b8792641
13aba1c94088
1458522834ad
15301d7e768a
hex1aed943e11

115655065105 has 8 divisors (see below), whose sum is σ = 138794985000. Its totient is φ = 92518114176.

The previous prime is 115655065079. The next prime is 115655065157. The reversal of 115655065105 is 501560556511.

It can be written as a sum of positive squares in 4 ways, for example, as 8678971921 + 106976093184 = 93161^2 + 327072^2 .

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 115655065105 - 25 = 115655065073 is a prime.

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

It is an unprimeable number.

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

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

Almost surely, 2115655065105 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1484483.

The product of its (nonzero) digits is 112500, while the sum is 40.

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

Divisors: 1 5 15749 78745 1468729 7343645 23131013021 115655065105