Search a number
-
+
105563665113 = 3128212744551
BaseRepresentation
bin110001001010000010…
…1011011001011011001
3101002110220122210222120
41202110011123023121
53212143244240423
6120254551411453
710424652230334
oct1422405331331
9332426583876
10105563665113
1140850a34045
1218561083b89
139c5438468a
145175d2b61b
152b2c8d2ee3
hex189415b2d9

105563665113 has 8 divisors (see below), whose sum is σ = 140762582976. Its totient is φ = 70370262000.

The previous prime is 105563665093. The next prime is 105563665127. The reversal of 105563665113 is 311566365501.

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

It is not a de Polignac number, because 105563665113 - 213 = 105563656921 is a prime.

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

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 2105563665113 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 2757375.

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

The spelling of 105563665113 in words is "one hundred five billion, five hundred sixty-three million, six hundred sixty-five thousand, one hundred thirteen".

Divisors: 1 3 12821 38463 2744551 8233653 35187888371 105563665113