Search a number
-
+
11100105051 = 37528576431
BaseRepresentation
bin10100101011001111…
…00010100101011011
31001122120210202112220
422111213202211123
5140213111330201
65033241435123
7542033223210
oct122547424533
931576722486
1011100105051
1147867a1242
12219949baa3
13107b8a6bc9
147742cbb07
1544e765036
hex2959e295b

11100105051 has 8 divisors (see below), whose sum is σ = 16914445824. Its totient is φ = 6342917160.

The previous prime is 11100105031. The next prime is 11100105053. The reversal of 11100105051 is 15050100111.

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

It is not a de Polignac number, because 11100105051 - 27 = 11100104923 is a prime.

It is a super-3 number, since 3×111001050513 (a number of 31 digits) contains 333 as substring.

It is a self number, because there is not a number n which added to its sum of digits gives 11100105051.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 264288195 + ... + 264288236.

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

Almost surely, 211100105051 is an apocalyptic number.

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

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

11100105051 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 528576441.

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

Adding to 11100105051 its reverse (15050100111), we get a palindrome (26150205162).

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

Divisors: 1 3 7 21 528576431 1585729293 3700035017 11100105051