Search a number
-
+
11011310133 = 33670436711
BaseRepresentation
bin10100100000101001…
…10100001000110101
31001102101201111211020
422100110310020311
5140022343411013
65020350331353
7536604406665
oct122024641065
931371644736
1011011310133
11474066330a
1221737b9b59
131066387635
147665b61a5
15446a75623
hex290534235

11011310133 has 4 divisors (see below), whose sum is σ = 14681746848. Its totient is φ = 7340873420.

The previous prime is 11011310119. The next prime is 11011310137. The reversal of 11011310133 is 33101311011.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 11011310133 - 28 = 11011309877 is a prime.

It is a congruent number.

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

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1835218353 + ... + 1835218358.

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

Almost surely, 211011310133 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 3670436714.

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

Adding to 11011310133 its reverse (33101311011), we get a palindrome (44112621144).

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

Divisors: 1 3 3670436711 11011310133