Search a number
-
+
11011011051 = 33670337017
BaseRepresentation
bin10100100000100111…
…01011000111101011
31001102101011022120010
422100103223013223
5140022304323201
65020340103003
7536602023015
oct122023530753
931371138503
1011011011051
114740479637
122173694a63
1310662b1471
147665391b5
15446a16bd6
hex2904eb1eb

11011011051 has 4 divisors (see below), whose sum is σ = 14681348072. Its totient is φ = 7340674032.

The previous prime is 11011011023. The next prime is 11011011059. The reversal of 11011011051 is 15011011011.

It is a happy number.

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

It is a semiprime because it is the product of two primes.

It is not a de Polignac number, because 11011011051 - 26 = 11011010987 is a prime.

It is a Duffinian number.

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

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

Almost surely, 211011011051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 3670337020.

The product of its (nonzero) digits is 5, while the sum is 12.

Adding to 11011011051 its reverse (15011011011), we get a palindrome (26022022062).

The spelling of 11011011051 in words is "eleven billion, eleven million, eleven thousand, fifty-one".

Divisors: 1 3 3670337017 11011011051