Base | Representation |
---|---|
bin | 10100111001110001… |
… | …00010100111010101 |
3 | 1001222002011202220122 |
4 | 22130320202213111 |
5 | 140440313032013 |
6 | 5053314241325 |
7 | 545043305246 |
oct | 123470424725 |
9 | 31862152818 |
10 | 11222002133 |
11 | 4839589331 |
12 | 2212286245 |
13 | 109ac16464 |
14 | 78657cccd |
15 | 45a2e2a08 |
hex | 29ce229d5 |
11222002133 has 2 divisors, whose sum is σ = 11222002134. Its totient is φ = 11222002132.
The previous prime is 11222002087. The next prime is 11222002159. The reversal of 11222002133 is 33120022211.
11222002133 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9105358084 + 2116644049 = 95422^2 + 46007^2 .
It is a cyclic number.
It is not a de Polignac number, because 11222002133 - 26 = 11222002069 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11222002163) 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, 5611001066 + 5611001067.
It is an arithmetic number, because the mean of its divisors is an integer number (5611001067).
Almost surely, 211222002133 is an apocalyptic number.
It is an amenable number.
11222002133 is a deficient number, since it is larger than the sum of its proper divisors (1).
11222002133 is an equidigital number, since it uses as much as digits as its factorization.
11222002133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 11222002133 its reverse (33120022211), we get a palindrome (44342024344).
The spelling of 11222002133 in words is "eleven billion, two hundred twenty-two million, two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •