Search a number
-
+
11110203022 = 28329666959
BaseRepresentation
bin10100101100011100…
…00011111010001110
31001200021210210100211
422112032003322032
5140223202444042
65034242113034
7542215111312
oct122616037216
931607723324
1011110203022
114791468a76
1221a094b77a
131080a01239
14775799b42
154505ac017
hex296383e8e

11110203022 has 8 divisors (see below), whose sum is σ = 16667330400. Its totient is φ = 5554426224.

The previous prime is 11110202941. The next prime is 11110203031. The reversal of 11110203022 is 22030201111.

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

It is a sphenic number, since it is the product of 3 distinct primes.

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

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

It is a congruent number.

It is an unprimeable number.

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 3 ways as a sum of consecutive naturals, for example, 316822 + ... + 350137.

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

Almost surely, 211110203022 is an apocalyptic number.

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

11110203022 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 675290.

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

Adding to 11110203022 its reverse (22030201111), we get a palindrome (33140404133).

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

Divisors: 1 2 8329 16658 666959 1333918 5555101511 11110203022