Base | Representation |
---|---|
bin | 11111000000110110101… |
… | …000010111011101011101 |
3 | 21112202001102001022002122 |
4 | 133000312220113131131 |
5 | 234404214401032313 |
6 | 4311022532032325 |
7 | 306655424623553 |
oct | 37006650273535 |
9 | 7482042038078 |
10 | 2131220330333 |
11 | 751933352186 |
12 | 2a50654626a5 |
13 | 125c861cac53 |
14 | 7521a05bbd3 |
15 | 3a688045708 |
hex | 1f036a1775d |
2131220330333 has 2 divisors, whose sum is σ = 2131220330334. Its totient is φ = 2131220330332.
The previous prime is 2131220330297. The next prime is 2131220330357. The reversal of 2131220330333 is 3330330221312.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1607676915364 + 523543414969 = 1267942^2 + 723563^2 .
It is a cyclic number.
It is not a de Polignac number, because 2131220330333 - 26 = 2131220330269 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2131220338333) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1065610165166 + 1065610165167.
It is an arithmetic number, because the mean of its divisors is an integer number (1065610165167).
Almost surely, 22131220330333 is an apocalyptic number.
It is an amenable number.
2131220330333 is a deficient number, since it is larger than the sum of its proper divisors (1).
2131220330333 is an equidigital number, since it uses as much as digits as its factorization.
2131220330333 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5832, while the sum is 26.
Adding to 2131220330333 its reverse (3330330221312), we get a palindrome (5461550551645).
The spelling of 2131220330333 in words is "two trillion, one hundred thirty-one billion, two hundred twenty million, three hundred thirty thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •