Base | Representation |
---|---|
bin | 11001000010001100101011… |
… | …001011001111101101110001 |
3 | 112102211200001101120121211011 |
4 | 121002030223023033231301 |
5 | 103412403312004014301 |
6 | 1030100131340150521 |
7 | 32122423266633646 |
oct | 3102145313175561 |
9 | 472750041517734 |
10 | 110102211001201 |
11 | 3209a0a382a211 |
12 | 10422667838441 |
13 | 4958794b94a23 |
14 | 1d28d928a3dcd |
15 | cae027adda51 |
hex | 64232b2cfb71 |
110102211001201 has 2 divisors, whose sum is σ = 110102211001202. Its totient is φ = 110102211001200.
The previous prime is 110102211001199. The next prime is 110102211001213. The reversal of 110102211001201 is 102100112201011.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 61018735479601 + 49083475521600 = 7811449^2 + 7005960^2 .
It is a cyclic number.
It is not a de Polignac number, because 110102211001201 - 21 = 110102211001199 is a prime.
Together with 110102211001199, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (110102211001291) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55051105500600 + 55051105500601.
It is an arithmetic number, because the mean of its divisors is an integer number (55051105500601).
Almost surely, 2110102211001201 is an apocalyptic number.
It is an amenable number.
110102211001201 is a deficient number, since it is larger than the sum of its proper divisors (1).
110102211001201 is an equidigital number, since it uses as much as digits as its factorization.
110102211001201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 110102211001201 its reverse (102100112201011), we get a palindrome (212202323202212).
The spelling of 110102211001201 in words is "one hundred ten trillion, one hundred two billion, two hundred eleven million, one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •