Base | Representation |
---|---|
bin | 1001010001101110010101… |
… | …1001110100000101011111 |
3 | 1100010010020120202212022201 |
4 | 2110123211121310011133 |
5 | 2314104301341010421 |
6 | 33405510050152331 |
7 | 2101635004616053 |
oct | 224334531640537 |
9 | 40103216685281 |
10 | 10200101110111 |
11 | 32829251847a0 |
12 | 1188a212826a7 |
13 | 58cb333b9563 |
14 | 27398a80dc63 |
15 | 12a4dc1dab91 |
hex | 946e567415f |
10200101110111 has 16 divisors (see below), whose sum is σ = 11509349760000. Its totient is φ = 8955712483200.
The previous prime is 10200101110081. The next prime is 10200101110139. The reversal of 10200101110111 is 11101110100201.
It is a cyclic number.
It is not a de Polignac number, because 10200101110111 - 25 = 10200101110079 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 (10200101110811) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 29802106 + ... + 30142423.
It is an arithmetic number, because the mean of its divisors is an integer number (719334360000).
Almost surely, 210200101110111 is an apocalyptic number.
10200101110111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10200101110111 is a deficient number, since it is larger than the sum of its proper divisors (1309248649889).
10200101110111 is a wasteful number, since it uses less digits than its factorization.
10200101110111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59945070.
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 10200101110111 its reverse (11101110100201), we get a palindrome (21301211210312).
The spelling of 10200101110111 in words is "ten trillion, two hundred billion, one hundred one million, one hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •