Base | Representation |
---|---|
bin | 110011010100100001… |
… | …0010000000111100101 |
3 | 101112110201210021212021 |
4 | 1212221002100013211 |
5 | 3301202242402323 |
6 | 122344013223141 |
7 | 10651052403442 |
oct | 1465102200745 |
9 | 345421707767 |
10 | 110210122213 |
11 | 42815817034 |
12 | 19439191ab1 |
13 | a514bb9589 |
14 | 549707c9c9 |
15 | 2d007a105d |
hex | 19a90901e5 |
110210122213 has 2 divisors, whose sum is σ = 110210122214. Its totient is φ = 110210122212.
The previous prime is 110210122177. The next prime is 110210122241. The reversal of 110210122213 is 312221012011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 96088840324 + 14121281889 = 309982^2 + 118833^2 .
It is a cyclic number.
It is not a de Polignac number, because 110210122213 - 29 = 110210121701 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110210122313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55105061106 + 55105061107.
It is an arithmetic number, because the mean of its divisors is an integer number (55105061107).
Almost surely, 2110210122213 is an apocalyptic number.
It is an amenable number.
110210122213 is a deficient number, since it is larger than the sum of its proper divisors (1).
110210122213 is an equidigital number, since it uses as much as digits as its factorization.
110210122213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 110210122213 its reverse (312221012011), we get a palindrome (422431134224).
The spelling of 110210122213 in words is "one hundred ten billion, two hundred ten million, one hundred twenty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •