Base | Representation |
---|---|
bin | 1010000111011001011011… |
… | …0110111011111111010001 |
3 | 1110101021100022222120212121 |
4 | 2201312112312323333101 |
5 | 2424211232014010413 |
6 | 35353245125454241 |
7 | 2225360342204503 |
oct | 241662666737721 |
9 | 43337308876777 |
10 | 11122201313233 |
11 | 35a899876026a |
12 | 12b7682871381 |
13 | 628a856ac71a |
14 | 2a6462dbbd73 |
15 | 1444a9a3ab8d |
hex | a1d96dbbfd1 |
11122201313233 has 2 divisors, whose sum is σ = 11122201313234. Its totient is φ = 11122201313232.
The previous prime is 11122201313221. The next prime is 11122201313239. The reversal of 11122201313233 is 33231310222111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10870525514304 + 251675798929 = 3297048^2 + 501673^2 .
It is a cyclic number.
It is not a de Polignac number, because 11122201313233 - 217 = 11122201182161 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11122201313198 and 11122201313207.
It is not a weakly prime, because it can be changed into another prime (11122201313239) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5561100656616 + 5561100656617.
It is an arithmetic number, because the mean of its divisors is an integer number (5561100656617).
Almost surely, 211122201313233 is an apocalyptic number.
It is an amenable number.
11122201313233 is a deficient number, since it is larger than the sum of its proper divisors (1).
11122201313233 is an equidigital number, since it uses as much as digits as its factorization.
11122201313233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 11122201313233 its reverse (33231310222111), we get a palindrome (44353511535344).
The spelling of 11122201313233 in words is "eleven trillion, one hundred twenty-two billion, two hundred one million, three hundred thirteen thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •