Base | Representation |
---|---|
bin | 11001000011101000111000… |
… | …100101011010000100111001 |
3 | 112110012010121111212121102112 |
4 | 121003220320211122010321 |
5 | 103421014044333223001 |
6 | 1030213424111142105 |
7 | 32132526653220203 |
oct | 3103507045320471 |
9 | 473163544777375 |
10 | 110201220211001 |
11 | 32128090961a37 |
12 | 10439899814935 |
13 | 4964c1334027a |
14 | 1d2daa60d3773 |
15 | cb18bed65cbb |
hex | 643a3895a139 |
110201220211001 has 2 divisors, whose sum is σ = 110201220211002. Its totient is φ = 110201220211000.
The previous prime is 110201220210997. The next prime is 110201220211079. The reversal of 110201220211001 is 100112022102011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 107338613389225 + 2862606821776 = 10360435^2 + 1691924^2 .
It is a cyclic number.
It is not a de Polignac number, because 110201220211001 - 22 = 110201220210997 is a prime.
It is a super-2 number, since 2×1102012202110012 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (110201220211501) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55100610105500 + 55100610105501.
It is an arithmetic number, because the mean of its divisors is an integer number (55100610105501).
Almost surely, 2110201220211001 is an apocalyptic number.
It is an amenable number.
110201220211001 is a deficient number, since it is larger than the sum of its proper divisors (1).
110201220211001 is an equidigital number, since it uses as much as digits as its factorization.
110201220211001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 110201220211001 its reverse (100112022102011), we get a palindrome (210313242313012).
The spelling of 110201220211001 in words is "one hundred ten trillion, two hundred one billion, two hundred twenty million, two hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •