Base | Representation |
---|---|
bin | 110010010000000111101101… |
… | …101100110111011111101101 |
3 | 1001222112100202021021221200012 |
4 | 302100013231230313133231 |
5 | 212432012211222041414 |
6 | 2102014351511143005 |
7 | 64360311543536456 |
oct | 6220075554673755 |
9 | 1058470667257605 |
10 | 221010120112109 |
11 | 64469958099299 |
12 | 209552aa074a65 |
13 | 964221b391863 |
14 | 3c80d3839612d |
15 | 1a83ea8d7333e |
hex | c901edb377ed |
221010120112109 has 2 divisors, whose sum is σ = 221010120112110. Its totient is φ = 221010120112108.
The previous prime is 221010120112091. The next prime is 221010120112147. The reversal of 221010120112109 is 901211021010122.
It is a happy number.
Together with previous prime (221010120112091) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 211684749372100 + 9325370740009 = 14549390^2 + 3053747^2 .
It is a cyclic number.
It is not a de Polignac number, because 221010120112109 - 212 = 221010120108013 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (221010120114109) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110505060056054 + 110505060056055.
It is an arithmetic number, because the mean of its divisors is an integer number (110505060056055).
Almost surely, 2221010120112109 is an apocalyptic number.
It is an amenable number.
221010120112109 is a deficient number, since it is larger than the sum of its proper divisors (1).
221010120112109 is an equidigital number, since it uses as much as digits as its factorization.
221010120112109 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 23.
The spelling of 221010120112109 in words is "two hundred twenty-one trillion, ten billion, one hundred twenty million, one hundred twelve thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •