Search a number
-
+
11110322003 = 112385323831
BaseRepresentation
bin10100101100011101…
…00000111101010011
31001200022000211120112
422112032200331103
5140223220301003
65034244431535
7542216115224
oct122616407523
931608024515
1011110322003
11479153a400
1221a09a85ab
131080a43441
147757cb24b
154505d23d8
hex2963a0f53

11110322003 has 12 divisors (see below), whose sum is σ = 12215854224. Its totient is φ = 10097247600.

The previous prime is 11110321987. The next prime is 11110322011. The reversal of 11110322003 is 30022301111.

11110322003 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is not a de Polignac number, because 11110322003 - 24 = 11110321987 is a prime.

It is a Duffinian number.

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

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

Almost surely, 211110322003 is an apocalyptic number.

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

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

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

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

The product of its (nonzero) digits is 36, while the sum is 14.

Adding to 11110322003 its reverse (30022301111), we get a palindrome (41132623114).

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

Divisors: 1 11 121 3853 23831 42383 262141 466213 2883551 91820843 1010029273 11110322003