Search a number
-
+
1105605106051 = 3113555000341
BaseRepresentation
bin10000000101101011001…
…100110001100110000011
310220200202112001122202011
4100011223030301212003
5121103234401343201
62203524042233351
7142606632225415
oct20055314614603
93820675048664
101105605106051
11396980294146
1215a334ab5857
13803480cc884
143b723a809b5
151db5cad3151
hex1016b331983

1105605106051 has 4 divisors (see below), whose sum is σ = 1109160106704. Its totient is φ = 1102050105400.

The previous prime is 1105605106027. The next prime is 1105605106057. The reversal of 1105605106051 is 1506015065011.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 1105605106051 - 25 = 1105605106019 is a prime.

It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.

It is a Duffinian number.

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

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

Almost surely, 21105605106051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 3555000652.

The product of its (nonzero) digits is 4500, while the sum is 31.

The spelling of 1105605106051 in words is "one trillion, one hundred five billion, six hundred five million, one hundred six thousand, fifty-one".

Divisors: 1 311 3555000341 1105605106051