Base | Representation |
---|---|
bin | 11110101101001011111… |
… | …000010101000111100101 |
3 | 21110201112122011222011200 |
4 | 132231023320111013211 |
5 | 234032442103000401 |
6 | 4253211212553113 |
7 | 305310203030634 |
oct | 36551370250745 |
9 | 7421478158150 |
10 | 2110102000101 |
11 | 7439866290a7 |
12 | 2a0b50a82799 |
13 | 123c9bc25264 |
14 | 741b542551b |
15 | 39d4e022686 |
hex | 1eb4be151e5 |
2110102000101 has 24 divisors (see below), whose sum is σ = 3103363483584. Its totient is φ = 1381282752960.
The previous prime is 2110102000073. The next prime is 2110102000103. The reversal of 2110102000101 is 1010002010112.
It is a happy number.
It is not a de Polignac number, because 2110102000101 - 210 = 2110101999077 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2110102000103) 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 23 ways as a sum of consecutive naturals, for example, 5438416 + ... + 5813481.
It is an arithmetic number, because the mean of its divisors is an integer number (129306811816).
Almost surely, 22110102000101 is an apocalyptic number.
It is an amenable number.
2110102000101 is a deficient number, since it is larger than the sum of its proper divisors (993261483483).
2110102000101 is a wasteful number, since it uses less digits than its factorization.
2110102000101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11252281 (or 11252278 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 2110102000101 its reverse (1010002010112), we get a palindrome (3120104010213).
The spelling of 2110102000101 in words is "two trillion, one hundred ten billion, one hundred two million, one hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •