Base | Representation |
---|---|
bin | 11111000000110110101… |
… | …011110000101111101101 |
3 | 21112202001110201111221121 |
4 | 133000312223300233231 |
5 | 234404220113022313 |
6 | 4311023003100541 |
7 | 306655435321402 |
oct | 37006653605755 |
9 | 7482043644847 |
10 | 2131221220333 |
11 | 7519338aa917 |
12 | 2a5065811751 |
13 | 125c8645008a |
14 | 7521a2102a9 |
15 | 3a68816e28d |
hex | 1f036af0bed |
2131221220333 has 2 divisors, whose sum is σ = 2131221220334. Its totient is φ = 2131221220332.
The previous prime is 2131221220307. The next prime is 2131221220343. The reversal of 2131221220333 is 3330221221312.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2063466171529 + 67755048804 = 1436477^2 + 260298^2 .
It is a cyclic number.
It is not a de Polignac number, because 2131221220333 - 221 = 2131219123181 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2131221220298 and 2131221220307.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2131221220343) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1065610610166 + 1065610610167.
It is an arithmetic number, because the mean of its divisors is an integer number (1065610610167).
Almost surely, 22131221220333 is an apocalyptic number.
It is an amenable number.
2131221220333 is a deficient number, since it is larger than the sum of its proper divisors (1).
2131221220333 is an equidigital number, since it uses as much as digits as its factorization.
2131221220333 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 2131221220333 its reverse (3330221221312), we get a palindrome (5461442441645).
The spelling of 2131221220333 in words is "two trillion, one hundred thirty-one billion, two hundred twenty-one million, two hundred twenty thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •