Search a number
-
+
105565655607 = 3227155015647
BaseRepresentation
bin110001001010000110…
…1000001001000110111
3101002111001101221102120
41202110031001020313
53212144301434412
6120255102211023
710425005160456
oct1422415011067
9332431357376
10105565655607
1140852073585
1218561883a73
139c54900699
1451762c8b9d
152b2cb77b8c
hex1894341237

105565655607 has 8 divisors (see below), whose sum is σ = 141374270976. Its totient is φ = 70067071992.

The previous prime is 105565655597. The next prime is 105565655639. The reversal of 105565655607 is 706556565501.

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

It is not a de Polignac number, because 105565655607 - 26 = 105565655543 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 105565655607.

It is a congruent number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 77507143 + ... + 77508504.

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

Almost surely, 2105565655607 is an apocalyptic number.

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

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

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

The sum of its prime factors is 155015877.

The product of its (nonzero) digits is 4725000, while the sum is 51.

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

Divisors: 1 3 227 681 155015647 465046941 35188551869 105565655607