Search a number
-
+
11113010133 = 323917154883
BaseRepresentation
bin10100101100110001…
…10001001111010101
31001200111002101222220
422112120301033111
5140224412311013
65034422212553
7542251012311
oct122630611725
931614071886
1011113010133
114793005aa5
1221a1884159
131081474b54
14775ccab41
15450963b23
hex2966313d5

11113010133 has 8 divisors (see below), whose sum is σ = 14818062048. Its totient is φ = 7408315824.

The previous prime is 11113010123. The next prime is 11113010173. The reversal of 11113010133 is 33101031111.

11113010133 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 not a de Polignac number, because 11113010133 - 25 = 11113010101 is a prime.

It is a congruent number.

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

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

Almost surely, 211113010133 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 178803.

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

Adding to 11113010133 its reverse (33101031111), we get a palindrome (44214041244).

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

Divisors: 1 3 23917 71751 154883 464649 3704336711 11113010133