Search a number
-
+
1105653555677 = 11100513959607
BaseRepresentation
bin10000000101101110000…
…101100110000111011101
310220200212220020011010202
4100011232011212013131
5121103334302240202
62203532532513245
7142611061105106
oct20055605460735
93820786204122
101105653555677
113969a5676060
1215a34917b825
13803551643a8
143b72a2933ad
151db61ea3802
hex1016e1661dd

1105653555677 has 4 divisors (see below), whose sum is σ = 1206167515296. Its totient is φ = 1005139596060.

The previous prime is 1105653555673. The next prime is 1105653555751. The reversal of 1105653555677 is 7765553565011.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 1105653555677 - 22 = 1105653555673 is a prime.

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (1105653555673) 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 3 ways as a sum of consecutive naturals, for example, 50256979793 + ... + 50256979814.

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

Almost surely, 21105653555677 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 100513959618.

The product of its (nonzero) digits is 16537500, while the sum is 56.

The spelling of 1105653555677 in words is "one trillion, one hundred five billion, six hundred fifty-three million, five hundred fifty-five thousand, six hundred seventy-seven".

Divisors: 1 11 100513959607 1105653555677