Base | Representation |
---|---|
bin | 10100100001111100… |
… | …10111000100001111 |
3 | 1001110011012211102111 |
4 | 22100332113010033 |
5 | 140033140413403 |
6 | 5021420004451 |
7 | 540066110044 |
oct | 122076270417 |
9 | 31404184374 |
10 | 11022201103 |
11 | 4746821911 |
12 | 2177390727 |
13 | 10686cb8b4 |
14 | 767c0d1cb |
15 | 4479c756d |
hex | 290f9710f |
11022201103 has 2 divisors, whose sum is σ = 11022201104. Its totient is φ = 11022201102.
The previous prime is 11022201097. The next prime is 11022201109. The reversal of 11022201103 is 30110222011.
11022201103 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a balanced prime because it is at equal distance from previous prime (11022201097) and next prime (11022201109).
It is an emirp because it is prime and its reverse (30110222011) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11022201103 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11022201109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5511100551 + 5511100552.
It is an arithmetic number, because the mean of its divisors is an integer number (5511100552).
Almost surely, 211022201103 is an apocalyptic number.
11022201103 is a deficient number, since it is larger than the sum of its proper divisors (1).
11022201103 is an equidigital number, since it uses as much as digits as its factorization.
11022201103 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 11022201103 its reverse (30110222011), we get a palindrome (41132423114).
The spelling of 11022201103 in words is "eleven billion, twenty-two million, two hundred one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.281 sec. • engine limits •