Base | Representation |
---|---|
bin | 110011010100100010… |
… | …1111110110111000101 |
3 | 101112110210121222021100 |
4 | 1212221011332313011 |
5 | 3301203020200401 |
6 | 122344050210313 |
7 | 10651063615434 |
oct | 1465105766705 |
9 | 345423558240 |
10 | 110211100101 |
11 | 42816324803 |
12 | 19439583999 |
13 | a51516c6cb |
14 | 549725511b |
15 | 2d008e5b86 |
hex | 19a917edc5 |
110211100101 has 12 divisors (see below), whose sum is σ = 159322520812. Its totient is φ = 73414662336.
The previous prime is 110211100099. The next prime is 110211100117. The reversal of 110211100101 is 101001112011.
It can be written as a sum of positive squares in 2 ways, for example, as 71863669476 + 38347430625 = 268074^2 + 195825^2 .
It is not a de Polignac number, because 110211100101 - 21 = 110211100099 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110211100121) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4938616 + ... + 4960881.
Almost surely, 2110211100101 is an apocalyptic number.
It is an amenable number.
110211100101 is a deficient number, since it is larger than the sum of its proper divisors (49111420711).
110211100101 is a wasteful number, since it uses less digits than its factorization.
110211100101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9900740 (or 9900737 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 110211100101 its reverse (101001112011), we get a palindrome (211212212112).
The spelling of 110211100101 in words is "one hundred ten billion, two hundred eleven million, one hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •