Base | Representation |
---|---|
bin | 1101001000000… |
… | …00001100111111 |
3 | 21200011201121100 |
4 | 12210000030333 |
5 | 211141220221 |
6 | 14531504143 |
7 | 2504563035 |
oct | 644001477 |
9 | 250151540 |
10 | 110101311 |
11 | 57170821 |
12 | 30a58053 |
13 | 19a6c508 |
14 | 108a0555 |
15 | 99ec926 |
hex | 690033f |
110101311 has 6 divisors (see below), whose sum is σ = 159035240. Its totient is φ = 73400868.
The previous prime is 110101309. The next prime is 110101331. The reversal of 110101311 is 113101011.
It is not a de Polignac number, because 110101311 - 21 = 110101309 is a prime.
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: 12233479 = 110101311 / (1 + 1 + 0 + 1 + 0 + 1 + 3 + 1 + 1).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110101293 and 110101302.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110101331) 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, 6116731 + ... + 6116748.
Almost surely, 2110101311 is an apocalyptic number.
110101311 is a deficient number, since it is larger than the sum of its proper divisors (48933929).
110101311 is a wasteful number, since it uses less digits than its factorization.
110101311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12233485 (or 12233482 counting only the distinct ones).
The product of its (nonzero) digits is 3, while the sum is 9.
The square root of 110101311 is about 10492.9171825570. The cubic root of 110101311 is about 479.2890386114.
Adding to 110101311 its reverse (113101011), we get a palindrome (223202322).
It can be divided in two parts, 11010 and 1311, that added together give a palindrome (12321).
The spelling of 110101311 in words is "one hundred ten million, one hundred one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •