Base | Representation |
---|---|
bin | 10100100001111011… |
… | …01001001011001101 |
3 | 1001110010212021120122 |
4 | 22100331221023031 |
5 | 140033113410013 |
6 | 5021411554325 |
7 | 540064365035 |
oct | 122075511315 |
9 | 31403767518 |
10 | 11022013133 |
11 | 474670366a |
12 | 21772bb9a5 |
13 | 1068664181 |
14 | 767ba08c5 |
15 | 44798ba08 |
hex | 290f692cd |
11022013133 has 2 divisors, whose sum is σ = 11022013134. Its totient is φ = 11022013132.
The previous prime is 11022013127. The next prime is 11022013217. The reversal of 11022013133 is 33131022011.
11022013133 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7842519364 + 3179493769 = 88558^2 + 56387^2 .
It is a cyclic number.
It is not a de Polignac number, because 11022013133 - 28 = 11022012877 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11022013633) 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, 5511006566 + 5511006567.
It is an arithmetic number, because the mean of its divisors is an integer number (5511006567).
Almost surely, 211022013133 is an apocalyptic number.
It is an amenable number.
11022013133 is a deficient number, since it is larger than the sum of its proper divisors (1).
11022013133 is an equidigital number, since it uses as much as digits as its factorization.
11022013133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 11022013133 its reverse (33131022011), we get a palindrome (44153035144).
The spelling of 11022013133 in words is "eleven billion, twenty-two million, thirteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •