Base | Representation |
---|---|
bin | 110011010001010101… |
… | …0011010110011010000 |
3 | 101112012021121122112201 |
4 | 1212202222122303100 |
5 | 3300442410224331 |
6 | 122325233532544 |
7 | 10645313565535 |
oct | 1464252326320 |
9 | 345167548481 |
10 | 110103211216 |
11 | 42770435239 |
12 | 19409414154 |
13 | a4c89c622b |
14 | 5486bacd8c |
15 | 2ce61d3a61 |
hex | 19a2a9acd0 |
110103211216 has 20 divisors (see below), whose sum is σ = 218528021124. Its totient is φ = 53708883200.
The previous prime is 110103211181. The next prime is 110103211217. The reversal of 110103211216 is 612112301011.
It can be written as a sum of positive squares in 2 ways, for example, as 2385345600 + 107717865616 = 48840^2 + 328204^2 .
It is a junction number, because it is equal to n+sod(n) for n = 110103211193 and 110103211202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110103211217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 83919475 + ... + 83920786.
Almost surely, 2110103211216 is an apocalyptic number.
110103211216 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
110103211216 is a deficient number, since it is larger than the sum of its proper divisors (108424809908).
110103211216 is a wasteful number, since it uses less digits than its factorization.
110103211216 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 167840310 (or 167840304 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 110103211216 its reverse (612112301011), we get a palindrome (722215512227).
The spelling of 110103211216 in words is "one hundred ten billion, one hundred three million, two hundred eleven thousand, two hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •