Base | Representation |
---|---|
bin | 1010000111010101010111… |
… | …1011100111110011011001 |
3 | 1110101011112102021212112111 |
4 | 2201311111323213303121 |
5 | 2424202014134202413 |
6 | 35352545054312321 |
7 | 2225321344323133 |
oct | 241652573476331 |
9 | 43334472255474 |
10 | 11121112022233 |
11 | 35a848989a874 |
12 | 12b7419ab86a1 |
13 | 628940b0b235 |
14 | 2a639c46a053 |
15 | 1444440bcd3d |
hex | a1d55ee7cd9 |
11121112022233 has 2 divisors, whose sum is σ = 11121112022234. Its totient is φ = 11121112022232.
The previous prime is 11121112022197. The next prime is 11121112022291. The reversal of 11121112022233 is 33222021112111.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6739278304144 + 4381833718089 = 2596012^2 + 2093283^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11121112022233 is a prime.
It is a super-2 number, since 2×111211120222332 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11121112022333) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5560556011116 + 5560556011117.
It is an arithmetic number, because the mean of its divisors is an integer number (5560556011117).
Almost surely, 211121112022233 is an apocalyptic number.
It is an amenable number.
11121112022233 is a deficient number, since it is larger than the sum of its proper divisors (1).
11121112022233 is an equidigital number, since it uses as much as digits as its factorization.
11121112022233 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 11121112022233 its reverse (33222021112111), we get a palindrome (44343133134344).
The spelling of 11121112022233 in words is "eleven trillion, one hundred twenty-one billion, one hundred twelve million, twenty-two thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •