Base | Representation |
---|---|
bin | 1001000110001100010111… |
… | …0010000110011010011111 |
3 | 1022102011220201112222120201 |
4 | 2101203011302012122133 |
5 | 2302333100020010421 |
6 | 33134504545124331 |
7 | 2051422636115104 |
oct | 221430562063237 |
9 | 38364821488521 |
10 | 10002002110111 |
11 | 3206909491a80 |
12 | 11565563296a7 |
13 | 577252b9116b |
14 | 268156db6aab |
15 | 125295ac0b91 |
hex | 918c5c8669f |
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".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •