Search a number
-
+
11102000020102 = 25551000010051
BaseRepresentation
bin1010000110001110001011…
…0001000111101010000110
31110022100012110200120100201
42201203202301013222012
52423343344001120402
635340104410001114
72224043624066245
oct241434261075206
943270173616321
1011102000020102
1135a0371645792
1212b378541619a
13626bb63b7034
142a54a809895c
15143bc62ac687
hexa18e2c47a86

11102000020102 has 4 divisors (see below), whose sum is σ = 16653000030156. Its totient is φ = 5551000010050.

The previous prime is 11102000020057. The next prime is 11102000020109. The reversal of 11102000020102 is 20102000020111.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (11102000020109) 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 as a sum of consecutive naturals, namely, 2775500005024 + ... + 2775500005027.

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

Almost surely, 211102000020102 is an apocalyptic number.

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

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

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

The sum of its prime factors is 5551000010053.

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

Adding to 11102000020102 its reverse (20102000020111), we get a palindrome (31204000040213).

Subtracting 11102000020102 from its reverse (20102000020111), we obtain a palindrome (9000000000009).

The spelling of 11102000020102 in words is "eleven trillion, one hundred two billion, twenty thousand, one hundred two".

Divisors: 1 2 5551000010051 11102000020102