Base | Representation |
---|---|
bin | 11110111000010100111… |
… | …100010110111111000101 |
3 | 21111212102101002001211011 |
4 | 132320110330112333011 |
5 | 234231442143230313 |
6 | 4302510250042221 |
7 | 306212516452534 |
oct | 36702474267705 |
9 | 7455371061734 |
10 | 2122065211333 |
11 | 748a65542831 |
12 | 2a332b419371 |
13 | 125157578a82 |
14 | 749cc1c831b |
15 | 3a2ee42793d |
hex | 1ee14f16fc5 |
2122065211333 has 2 divisors, whose sum is σ = 2122065211334. Its totient is φ = 2122065211332.
The previous prime is 2122065211313. The next prime is 2122065211381. The reversal of 2122065211333 is 3331125602212.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1343890703169 + 778174508164 = 1159263^2 + 882142^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2122065211333 is a prime.
It is a super-2 number, since 2×21220652113332 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2122065211295 and 2122065211304.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2122065211313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1061032605666 + 1061032605667.
It is an arithmetic number, because the mean of its divisors is an integer number (1061032605667).
Almost surely, 22122065211333 is an apocalyptic number.
It is an amenable number.
2122065211333 is a deficient number, since it is larger than the sum of its proper divisors (1).
2122065211333 is an equidigital number, since it uses as much as digits as its factorization.
2122065211333 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12960, while the sum is 31.
The spelling of 2122065211333 in words is "two trillion, one hundred twenty-two billion, sixty-five million, two hundred eleven thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.176 sec. • engine limits •