Base | Representation |
---|---|
bin | 10110110000101011010000… |
… | …001010000110101000011111 |
3 | 111010102122202111111222210200 |
4 | 112300223100022012220133 |
5 | 101110032344012010421 |
6 | 552522120215034543 |
7 | 30041062610601456 |
oct | 2660532012065037 |
9 | 433378674458720 |
10 | 100102000110111 |
11 | 2999402445463a |
12 | b28853136ba53 |
13 | 43b176913ab9c |
14 | 1aa0d69759b9d |
15 | b88d393de726 |
hex | 5b0ad0286a1f |
100102000110111 has 6 divisors (see below), whose sum is σ = 144591777936840. Its totient is φ = 66734666740068.
The previous prime is 100102000110103. The next prime is 100102000110137. The reversal of 100102000110111 is 111011000201001.
It is not a de Polignac number, because 100102000110111 - 23 = 100102000110103 is a prime.
It is a super-2 number, since 2×1001020001101112 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 11122444456679 = 100102000110111 / (1 + 0 + 0 + 1 + 0 + 2 + 0 + 0 + 0 + 1 + 1 + 0 + 1 + 1 + 1).
It is a junction number, because it is equal to n+sod(n) for n = 100102000110093 and 100102000110102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100102000112111) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 5561222228331 + ... + 5561222228348.
It is an arithmetic number, because the mean of its divisors is an integer number (24098629656140).
Almost surely, 2100102000110111 is an apocalyptic number.
100102000110111 is a deficient number, since it is larger than the sum of its proper divisors (44489777826729).
100102000110111 is a wasteful number, since it uses less digits than its factorization.
100102000110111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11122444456685 (or 11122444456682 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 100102000110111 its reverse (111011000201001), we get a palindrome (211113000311112).
The spelling of 100102000110111 in words is "one hundred trillion, one hundred two billion, one hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •