Base | Representation |
---|---|
bin | 1011000111010011011101… |
… | …1000000101000010100101 |
3 | 1121021020020112210021000001 |
4 | 2301310313120011002211 |
5 | 3100203241410003401 |
6 | 41553501433021301 |
7 | 2400605512536352 |
oct | 261646730050245 |
9 | 47236215707001 |
10 | 12220111016101 |
11 | 399157a10006a |
12 | 145440a554831 |
13 | 6a84753b6391 |
14 | 303656a03629 |
15 | 162d16c3e601 |
hex | b1d376050a5 |
12220111016101 has 2 divisors, whose sum is σ = 12220111016102. Its totient is φ = 12220111016100.
The previous prime is 12220111016033. The next prime is 12220111016119. The reversal of 12220111016101 is 10161011102221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7133033759076 + 5087077257025 = 2670774^2 + 2255455^2 .
It is a cyclic number.
It is not a de Polignac number, because 12220111016101 - 233 = 12211521081509 is a prime.
It is a super-2 number, since 2×122201110161012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12220111016171) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6110055508050 + 6110055508051.
It is an arithmetic number, because the mean of its divisors is an integer number (6110055508051).
Almost surely, 212220111016101 is an apocalyptic number.
It is an amenable number.
12220111016101 is a deficient number, since it is larger than the sum of its proper divisors (1).
12220111016101 is an equidigital number, since it uses as much as digits as its factorization.
12220111016101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 19.
Adding to 12220111016101 its reverse (10161011102221), we get a palindrome (22381122118322).
The spelling of 12220111016101 in words is "twelve trillion, two hundred twenty billion, one hundred eleven million, sixteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •