Search a number
-
+
1103362625641 = 19711375970157
BaseRepresentation
bin10000000011100101100…
…010011001000001101001
310220110222020102211221011
4100003211202121001221
5121034141313010031
62202513334143521
7142500232400563
oct20034542310151
93813866384834
101103362625641
11395a2a48a451
12159a09ab1ba1
138007b6466a3
143b58dd06333
151da7acc46b1
hex100e5899069

1103362625641 has 16 divisors (see below), whose sum is σ = 1186389797760. Its totient is φ = 1023045932160.

The previous prime is 1103362625597. The next prime is 1103362625647. The reversal of 1103362625641 is 1465262633011.

It is a cyclic number.

It is not a de Polignac number, because 1103362625641 - 213 = 1103362617449 is a prime.

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

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 1103362625594 and 1103362625603.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2800266 + ... + 3169891.

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

Almost surely, 21103362625641 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 5970384.

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

The spelling of 1103362625641 in words is "one trillion, one hundred three billion, three hundred sixty-two million, six hundred twenty-five thousand, six hundred forty-one".

Divisors: 1 19 71 137 1349 2603 9727 184813 5970157 113432983 423881147 817911509 8053741793 15540318671 58071717139 1103362625641