Base | Representation |
---|---|
bin | 110011010001100100… |
… | …0100001000100011101 |
3 | 101112012211110111120211 |
4 | 1212203020201010131 |
5 | 3301001420214323 |
6 | 122330115012421 |
7 | 10645440626461 |
oct | 1464310410435 |
9 | 345184414524 |
10 | 110111101213 |
11 | 427749340a3 |
12 | 1940bb9a111 |
13 | a4ca529579 |
14 | 5487c644a1 |
15 | 2ce6c4170d |
hex | 19a322111d |
110111101213 has 2 divisors, whose sum is σ = 110111101214. Its totient is φ = 110111101212.
The previous prime is 110111101207. The next prime is 110111101259. The reversal of 110111101213 is 312101111011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 71034509529 + 39076591684 = 266523^2 + 197678^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110111101213 is a prime.
It is a super-2 number, since 2×1101111012132 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 110111101193 and 110111101202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110111101613) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55055550606 + 55055550607.
It is an arithmetic number, because the mean of its divisors is an integer number (55055550607).
Almost surely, 2110111101213 is an apocalyptic number.
It is an amenable number.
110111101213 is a deficient number, since it is larger than the sum of its proper divisors (1).
110111101213 is an equidigital number, since it uses as much as digits as its factorization.
110111101213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6, while the sum is 13.
Adding to 110111101213 its reverse (312101111011), we get a palindrome (422212212224).
The spelling of 110111101213 in words is "one hundred ten billion, one hundred eleven million, one hundred one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •