Search a number
-
+
10002002110111 = 11909272919101
BaseRepresentation
bin1001000110001100010111…
…0010000110011010011111
31022102011220201112222120201
42101203011302012122133
52302333100020010421
633134504545124331
72051422636115104
oct221430562063237
938364821488521
1010002002110111
113206909491a80
1211565563296a7
13577252b9116b
14268156db6aab
15125295ac0b91
hex918c5c8669f

10002002110111 has 4 divisors (see below), whose sum is σ = 10911275029224. Its totient is φ = 9092729191000.

The previous prime is 10002002110099. The next prime is 10002002110153. The reversal of 10002002110111 is 11101120020001.

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

It is a cyclic number.

It is not a de Polignac number, because 10002002110111 - 29 = 10002002109599 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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

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

Almost surely, 210002002110111 is an apocalyptic number.

10002002110111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.

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

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

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

The sum of its prime factors is 909272919112.

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

Adding to 10002002110111 its reverse (11101120020001), we get a palindrome (21103122130112).

The spelling of 10002002110111 in words is "ten trillion, two billion, two million, one hundred ten thousand, one hundred eleven".

Divisors: 1 11 909272919101 10002002110111