Search a number
-
+
11010132103 = 1919912232381
BaseRepresentation
bin10100100000100000…
…10100100010000111
31001102022111122212111
422100100110202013
5140022043211403
65020305201451
7536561402335
oct122020244207
931368448774
1011010132103
11473aa29233
122173330287
131066064389
1476638ab55
154468e156d
hex290414887

11010132103 has 16 divisors (see below), whose sum is σ = 11662272000. Its totient is φ = 10365395040.

The previous prime is 11010132097. The next prime is 11010132113. The reversal of 11010132103 is 30123101011.

It is a cyclic number.

It is not a de Polignac number, because 11010132103 - 29 = 11010131591 is a prime.

It is a super-2 number, since 2×110101321032 (a number of 21 digits) 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 (11010132113) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (11) of ones.

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

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

Almost surely, 211010132103 is an apocalyptic number.

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

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

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

The sum of its prime factors is 3822.

The product of its (nonzero) digits is 18, while the sum is 13.

Adding to 11010132103 its reverse (30123101011), we get a palindrome (41133233114).

The spelling of 11010132103 in words is "eleven billion, ten million, one hundred thirty-two thousand, one hundred three".

Divisors: 1 19 199 1223 2381 3781 23237 45239 243377 473819 2911963 4624163 9002561 55327297 579480637 11010132103