Base | Representation |
---|---|
bin | 110011010001001111… |
… | …1000000100100110101 |
3 | 101112012001222200122211 |
4 | 1212202133000210311 |
5 | 3300441124021323 |
6 | 122325045453421 |
7 | 10645246300444 |
oct | 1464237004465 |
9 | 345161880584 |
10 | 110100220213 |
11 | 42769782035 |
12 | 19408411271 |
13 | a4c81b99c9 |
14 | 5486630d5b |
15 | 2ce5ce270d |
hex | 19a27c0935 |
110100220213 has 2 divisors, whose sum is σ = 110100220214. Its totient is φ = 110100220212.
The previous prime is 110100220159. The next prime is 110100220271. The reversal of 110100220213 is 312022001011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 104871050244 + 5229169969 = 323838^2 + 72313^2 .
It is a cyclic number.
It is not a de Polignac number, because 110100220213 - 221 = 110098123061 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110100220193 and 110100220202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110100220283) 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 as a sum of consecutive naturals, namely, 55050110106 + 55050110107.
It is an arithmetic number, because the mean of its divisors is an integer number (55050110107).
Almost surely, 2110100220213 is an apocalyptic number.
It is an amenable number.
110100220213 is a deficient number, since it is larger than the sum of its proper divisors (1).
110100220213 is an equidigital number, since it uses as much as digits as its factorization.
110100220213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 110100220213 its reverse (312022001011), we get a palindrome (422122221224).
The spelling of 110100220213 in words is "one hundred ten billion, one hundred million, two hundred twenty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •