Base | Representation |
---|---|
bin | 110011001110111000… |
… | …1111111111011010101 |
3 | 101111222120111202020022 |
4 | 1212131301333323111 |
5 | 3300310423442323 |
6 | 122313150314525 |
7 | 10643300503121 |
oct | 1463561777325 |
9 | 344876452208 |
10 | 110021312213 |
11 | 4272918730a |
12 | 193a5ab8a45 |
13 | a4b4a4c697 |
14 | 5479d70581 |
15 | 2cdde074c8 |
hex | 199dc7fed5 |
110021312213 has 2 divisors, whose sum is σ = 110021312214. Its totient is φ = 110021312212.
The previous prime is 110021312183. The next prime is 110021312227. The reversal of 110021312213 is 312213120011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 104402010769 + 5619301444 = 323113^2 + 74962^2 .
It is a cyclic number.
It is not a de Polignac number, because 110021312213 - 210 = 110021311189 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110021312191 and 110021312200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110021312263) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55010656106 + 55010656107.
It is an arithmetic number, because the mean of its divisors is an integer number (55010656107).
Almost surely, 2110021312213 is an apocalyptic number.
It is an amenable number.
110021312213 is a deficient number, since it is larger than the sum of its proper divisors (1).
110021312213 is an equidigital number, since it uses as much as digits as its factorization.
110021312213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 110021312213 its reverse (312213120011), we get a palindrome (422234432224).
The spelling of 110021312213 in words is "one hundred ten billion, twenty-one million, three hundred twelve thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.119 sec. • engine limits •