Base | Representation |
---|---|
bin | 11001000100000100110110… |
… | …101000000110001000111101 |
3 | 112110022000010111020021202011 |
4 | 121010010312220012020331 |
5 | 103422012101021214123 |
6 | 1030235312123331221 |
7 | 32134642121306326 |
oct | 3104046650061075 |
9 | 473260114207664 |
10 | 110231252132413 |
11 | 321398a2118aa5 |
12 | 1044367b380b11 |
13 | 49679bb200a79 |
14 | 1d3131488b44d |
15 | cb257b697e0d |
hex | 644136a0623d |
110231252132413 has 2 divisors, whose sum is σ = 110231252132414. Its totient is φ = 110231252132412.
The previous prime is 110231252132369. The next prime is 110231252132437. The reversal of 110231252132413 is 314231252132011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 83639109375364 + 26592142757049 = 9145442^2 + 5156757^2 .
It is a cyclic number.
It is not a de Polignac number, because 110231252132413 - 217 = 110231252001341 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110231252139413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55115626066206 + 55115626066207.
It is an arithmetic number, because the mean of its divisors is an integer number (55115626066207).
Almost surely, 2110231252132413 is an apocalyptic number.
It is an amenable number.
110231252132413 is a deficient number, since it is larger than the sum of its proper divisors (1).
110231252132413 is an equidigital number, since it uses as much as digits as its factorization.
110231252132413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8640, while the sum is 31.
The spelling of 110231252132413 in words is "one hundred ten trillion, two hundred thirty-one billion, two hundred fifty-two million, one hundred thirty-two thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •