Base | Representation |
---|---|
bin | 11110110110100111000… |
… | …001101010111111011001 |
3 | 21111200122212002000200102 |
4 | 132312213001222333121 |
5 | 234214203101011413 |
6 | 4302003252345145 |
7 | 306116025036512 |
oct | 36664701527731 |
9 | 7450585060612 |
10 | 2120221110233 |
11 | 7481a95a7336 |
12 | 2a2ab59151b5 |
13 | 124c224b75a5 |
14 | 74895311a09 |
15 | 3a2425ac458 |
hex | 1eda706afd9 |
2120221110233 has 2 divisors, whose sum is σ = 2120221110234. Its totient is φ = 2120221110232.
The previous prime is 2120221110221. The next prime is 2120221110247. The reversal of 2120221110233 is 3320111220212.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2044236533824 + 75984576409 = 1429768^2 + 275653^2 .
It is a cyclic number.
It is not a de Polignac number, because 2120221110233 - 236 = 2051501633497 is a prime.
It is a super-3 number, since 3×21202211102333 (a number of 38 digits) contains 333 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (2120211110233) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1060110555116 + 1060110555117.
It is an arithmetic number, because the mean of its divisors is an integer number (1060110555117).
Almost surely, 22120221110233 is an apocalyptic number.
It is an amenable number.
2120221110233 is a deficient number, since it is larger than the sum of its proper divisors (1).
2120221110233 is an equidigital number, since it uses as much as digits as its factorization.
2120221110233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 2120221110233 its reverse (3320111220212), we get a palindrome (5440332330445).
The spelling of 2120221110233 in words is "two trillion, one hundred twenty billion, two hundred twenty-one million, one hundred ten thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •