Search a number
-
+
11500111021 = 72371429261
BaseRepresentation
bin10101011010111010…
…11100010010101101
31002200110111011120211
422231131130102231
5142023012023041
65141051142421
7554661221320
oct125535342255
932613434524
1011500111021
114971570693
12228b444a11
13111371b129
147b14947b7
1547492a481
hex2ad75c4ad

11500111021 has 8 divisors (see below), whose sum is σ = 13714418304. Its totient is φ = 9428662320.

The previous prime is 11500111009. The next prime is 11500111061. The reversal of 11500111021 is 12011100511.

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

It is not a de Polignac number, because 11500111021 - 27 = 11500110893 is a prime.

It is a Duffinian number.

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

It is a congruent number.

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

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

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

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

Almost surely, 211500111021 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 71429291.

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

Adding to 11500111021 its reverse (12011100511), we get a palindrome (23511211532).

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

Divisors: 1 7 23 161 71429261 500004827 1642873003 11500111021