Base | Representation |
---|---|
bin | 10100100001111100… |
… | …00000110110010101 |
3 | 1001110011001012121001 |
4 | 22100332000312111 |
5 | 140033130010401 |
6 | 5021414023301 |
7 | 540065250532 |
oct | 122076006625 |
9 | 31404035531 |
10 | 11022110101 |
11 | 474676a502 |
12 | 2177347b31 |
13 | 1068699352 |
14 | 767bc7d89 |
15 | 4479aa601 |
hex | 290f80d95 |
11022110101 has 2 divisors, whose sum is σ = 11022110102. Its totient is φ = 11022110100.
The previous prime is 11022110051. The next prime is 11022110119. The reversal of 11022110101 is 10101122011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9237132100 + 1784978001 = 96110^2 + 42249^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11022110101 is a prime.
It is a super-2 number, since 2×110221101012 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11022110131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5511055050 + 5511055051.
It is an arithmetic number, because the mean of its divisors is an integer number (5511055051).
Almost surely, 211022110101 is an apocalyptic number.
It is an amenable number.
11022110101 is a deficient number, since it is larger than the sum of its proper divisors (1).
11022110101 is an equidigital number, since it uses as much as digits as its factorization.
11022110101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 11022110101 its reverse (10101122011), we get a palindrome (21123232112).
The spelling of 11022110101 in words is "eleven billion, twenty-two million, one hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •