Search a number
-
+
1103705361 = 321111148539
BaseRepresentation
bin100000111001001…
…0011010100010001
32211220211001010100
41001302103110101
54230022032421
6301304123013
736231224613
oct10162232421
92756731110
101103705361
115170161a0
12269766469
1314787a3c5
14a6824db3
1566d68c26
hex41c93511

1103705361 has 12 divisors (see below), whose sum is σ = 1739172240. Its totient is φ = 668912280.

The previous prime is 1103705353. The next prime is 1103705387. The reversal of 1103705361 is 1635073011.

It is not a de Polignac number, because 1103705361 - 23 = 1103705353 is a prime.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5574171 + ... + 5574368.

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

Almost surely, 21103705361 is an apocalyptic number.

1103705361 is a gapful number since it is divisible by the number (11) formed by its first and last digit.

It is an amenable number.

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

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

1103705361 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 11148556 (or 11148553 counting only the distinct ones).

The product of its (nonzero) digits is 1890, while the sum is 27.

The square root of 1103705361 is about 33222.0613598855. The cubic root of 1103705361 is about 1033.4378983906.

Adding to 1103705361 its reverse (1635073011), we get a palindrome (2738778372).

The spelling of 1103705361 in words is "one billion, one hundred three million, seven hundred five thousand, three hundred sixty-one".

Divisors: 1 3 9 11 33 99 11148539 33445617 100336851 122633929 367901787 1103705361