Base | Representation |
---|---|
bin | 10100100001111100… |
… | …11011101100011101 |
3 | 1001110011020210102122 |
4 | 22100332123230131 |
5 | 140033142020221 |
6 | 5021420232325 |
7 | 540066216236 |
oct | 122076335435 |
9 | 31404223378 |
10 | 11022220061 |
11 | 4746835086 |
12 | 217739b6a5 |
13 | 1068707408 |
14 | 767c1608d |
15 | 4479cceab |
hex | 290f9bb1d |
11022220061 has 2 divisors, whose sum is σ = 11022220062. Its totient is φ = 11022220060.
The previous prime is 11022220007. The next prime is 11022220063. The reversal of 11022220061 is 16002222011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9094483225 + 1927736836 = 95365^2 + 43906^2 .
It is a cyclic number.
It is not a de Polignac number, because 11022220061 - 26 = 11022219997 is a prime.
It is a super-2 number, since 2×110222200612 (a number of 21 digits) contains 22 as substring.
Together with 11022220063, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11022220063) 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, 5511110030 + 5511110031.
It is an arithmetic number, because the mean of its divisors is an integer number (5511110031).
Almost surely, 211022220061 is an apocalyptic number.
It is an amenable number.
11022220061 is a deficient number, since it is larger than the sum of its proper divisors (1).
11022220061 is an equidigital number, since it uses as much as digits as its factorization.
11022220061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 11022220061 its reverse (16002222011), we get a palindrome (27024442072).
The spelling of 11022220061 in words is "eleven billion, twenty-two million, two hundred twenty thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •