Base | Representation |
---|---|
bin | 10110110010001111111100… |
… | …000001000001110110000111 |
3 | 111010210222210212120001221210 |
4 | 112302033330001001312013 |
5 | 101113320301142023421 |
6 | 553043520011342503 |
7 | 30051640642464660 |
oct | 2662177401016607 |
9 | 433728725501853 |
10 | 100210110111111 |
11 | 29a2596175a500 |
12 | b2a5483151a33 |
13 | 43bba07bc6390 |
14 | 1aa62a391a367 |
15 | b8ba65602576 |
hex | 5b23fc041d87 |
100210110111111 has 48 divisors (see below), whose sum is σ = 180756189350912. Its totient is φ = 48052800037440.
The previous prime is 100210110111107. The next prime is 100210110111191. The reversal of 100210110111111 is 111111011012001.
It is not a de Polignac number, because 100210110111111 - 22 = 100210110111107 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100210110111191) 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 47 ways as a sum of consecutive naturals, for example, 1516785151 + ... + 1516851216.
Almost surely, 2100210110111111 is an apocalyptic number.
100210110111111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
100210110111111 is a deficient number, since it is larger than the sum of its proper divisors (80546079239801).
100210110111111 is a wasteful number, since it uses less digits than its factorization.
100210110111111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3033636412 (or 3033636401 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 12.
Adding to 100210110111111 its reverse (111111011012001), we get a palindrome (211321121123112).
The spelling of 100210110111111 in words is "one hundred trillion, two hundred ten billion, one hundred ten million, one hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •