Base | Representation |
---|---|
bin | 10000010101001000100… |
… | …101011101000011000001 |
3 | 10222021121100021010201021 |
4 | 100111020211131003001 |
5 | 121341233241221423 |
6 | 2215311123305441 |
7 | 144035160446203 |
oct | 20251045350301 |
9 | 3867540233637 |
10 | 1122204242113 |
11 | 3a2a19047809 |
12 | 1615a7b1b281 |
13 | 81a9203b386 |
14 | 3c45a412773 |
15 | 1e2ceec595d |
hex | 1054895d0c1 |
1122204242113 has 2 divisors, whose sum is σ = 1122204242114. Its totient is φ = 1122204242112.
The previous prime is 1122204242111. The next prime is 1122204242143. The reversal of 1122204242113 is 3112424022211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1119093168384 + 3111073729 = 1057872^2 + 55777^2 .
It is a cyclic number.
It is not a de Polignac number, because 1122204242113 - 21 = 1122204242111 is a prime.
It is a super-2 number, since 2×11222042421132 (a number of 25 digits) contains 22 as substring.
Together with 1122204242111, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (1122204242111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 561102121056 + 561102121057.
It is an arithmetic number, because the mean of its divisors is an integer number (561102121057).
Almost surely, 21122204242113 is an apocalyptic number.
It is an amenable number.
1122204242113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1122204242113 is an equidigital number, since it uses as much as digits as its factorization.
1122204242113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 1122204242113 its reverse (3112424022211), we get a palindrome (4234628264324).
The spelling of 1122204242113 in words is "one trillion, one hundred twenty-two billion, two hundred four million, two hundred forty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •