Base | Representation |
---|---|
bin | 110011010001100010… |
… | …1000101010100001101 |
3 | 101112012202202202212100 |
4 | 1212203011011110031 |
5 | 3301001202413401 |
6 | 122330043425313 |
7 | 10645430160315 |
oct | 1464305052415 |
9 | 345182682770 |
10 | 110110201101 |
11 | 427743798aa |
12 | 1940b825239 |
13 | a4ca2a2964 |
14 | 5487aac445 |
15 | 2ce6b14b86 |
hex | 19a314550d |
110110201101 has 48 divisors (see below), whose sum is σ = 178076441088. Its totient is φ = 65229235200.
The previous prime is 110110201073. The next prime is 110110201121. The reversal of 110110201101 is 101102011011.
It is not a de Polignac number, because 110110201101 - 26 = 110110201037 is a prime.
It is a super-2 number, since 2×1101102011012 (a number of 23 digits) contains 22 as substring.
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 (110110201121) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 88651 + ... + 477576.
It is an arithmetic number, because the mean of its divisors is an integer number (3709925856).
Almost surely, 2110110201101 is an apocalyptic number.
It is an amenable number.
110110201101 is a deficient number, since it is larger than the sum of its proper divisors (67966239987).
110110201101 is a wasteful number, since it uses less digits than its factorization.
110110201101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 566322 (or 566319 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 110110201101 its reverse (101102011011), we get a palindrome (211212212112).
The spelling of 110110201101 in words is "one hundred ten billion, one hundred ten million, two hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •