Search a number
-
+
1106050141 = 717711091201
BaseRepresentation
bin100000111101100…
…1111110001011101
32212002020011120001
41001323033301131
54231122101031
6301430254301
736260161660
oct10173176135
92762204501
101106050141
11518377929
1226a4b7391
131481bb751
14a6c756d7
156717d861
hex41ecfc5d

1106050141 has 32 divisors (see below), whose sum is σ = 1370856960. Its totient is φ = 870912000.

The previous prime is 1106050133. The next prime is 1106050181. The reversal of 1106050141 is 1410506011.

It is not a de Polignac number, because 1106050141 - 23 = 1106050133 is a prime.

It is a super-2 number, since 2×11060501412 = 2446693828812239762, which contains 22 as substring.

It is a Duffinian number.

It is a congruent number.

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

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 920341 + ... + 921541.

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

Almost surely, 21106050141 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1405.

The product of its (nonzero) digits is 120, while the sum is 19.

The square root of 1106050141 is about 33257.3321389434. The cubic root of 1106050141 is about 1034.1692139016.

Adding to 1106050141 its reverse (1410506011), we get a palindrome (2516556152).

The spelling of 1106050141 in words is "one billion, one hundred six million, fifty thousand, one hundred forty-one".

Divisors: 1 7 17 71 109 119 497 763 1201 1207 1853 7739 8407 8449 12971 20417 54173 85271 130909 131563 142919 596897 916363 920941 1449607 2225453 9294539 10147249 15578171 65061773 158007163 1106050141