Base | Representation |
---|---|
bin | 110011010001100100… |
… | …1101101001111011101 |
3 | 101112012212001100120101 |
4 | 1212203021231033131 |
5 | 3301002010210323 |
6 | 122330125421101 |
7 | 10645443366214 |
oct | 1464311551735 |
9 | 345185040511 |
10 | 110111413213 |
11 | 4277502754a |
12 | 1941010a791 |
13 | a4ca608599 |
14 | 5487d0607b |
15 | 2ce6ca3dad |
hex | 19a326d3dd |
110111413213 has 2 divisors, whose sum is σ = 110111413214. Its totient is φ = 110111413212.
The previous prime is 110111413199. The next prime is 110111413277. The reversal of 110111413213 is 312314111011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 90746742564 + 19364670649 = 301242^2 + 139157^2 .
It is a cyclic number.
It is not a de Polignac number, because 110111413213 - 233 = 101521478621 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110111413283) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55055706606 + 55055706607.
It is an arithmetic number, because the mean of its divisors is an integer number (55055706607).
Almost surely, 2110111413213 is an apocalyptic number.
It is an amenable number.
110111413213 is a deficient number, since it is larger than the sum of its proper divisors (1).
110111413213 is an equidigital number, since it uses as much as digits as its factorization.
110111413213 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 19.
Adding to 110111413213 its reverse (312314111011), we get a palindrome (422425524224).
The spelling of 110111413213 in words is "one hundred ten billion, one hundred eleven million, four hundred thirteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •