Base | Representation |
---|---|
bin | 11110110110100111001… |
… | …001101011111101000101 |
3 | 21111200200000000202211221 |
4 | 132312213021223331011 |
5 | 234214204120230313 |
6 | 4302003405400341 |
7 | 306116051640253 |
oct | 36664711537505 |
9 | 7450600022757 |
10 | 2120223211333 |
11 | 7481aa801987 |
12 | 2a2ab65690b1 |
13 | 124c22a71a46 |
14 | 748956db5d3 |
15 | 3a242874c8d |
hex | 1eda726bf45 |
2120223211333 has 2 divisors, whose sum is σ = 2120223211334. Its totient is φ = 2120223211332.
The previous prime is 2120223211303. The next prime is 2120223211357. The reversal of 2120223211333 is 3331123220212.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1741022192484 + 379201018849 = 1319478^2 + 615793^2 .
It is a cyclic number.
It is not a de Polignac number, because 2120223211333 - 221 = 2120221114181 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2120223211298 and 2120223211307.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2120223211303) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1060111605666 + 1060111605667.
It is an arithmetic number, because the mean of its divisors is an integer number (1060111605667).
Almost surely, 22120223211333 is an apocalyptic number.
It is an amenable number.
2120223211333 is a deficient number, since it is larger than the sum of its proper divisors (1).
2120223211333 is an equidigital number, since it uses as much as digits as its factorization.
2120223211333 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 2120223211333 its reverse (3331123220212), we get a palindrome (5451346431545).
The spelling of 2120223211333 in words is "two trillion, one hundred twenty billion, two hundred twenty-three million, two hundred eleven thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.028 sec. • engine limits •