Base | Representation |
---|---|
bin | 11110110110011111111… |
… | …100000110101010101101 |
3 | 21111200100120100021112021 |
4 | 132312133330012222231 |
5 | 234213432131211341 |
6 | 4301543404110141 |
7 | 306113052306322 |
oct | 36663774065255 |
9 | 7450316307467 |
10 | 2120102210221 |
11 | 748148476a66 |
12 | 2a2a81b35351 |
13 | 124c03987258 |
14 | 74883600b49 |
15 | 3a236e229d1 |
hex | 1ed9ff06aad |
2120102210221 has 2 divisors, whose sum is σ = 2120102210222. Its totient is φ = 2120102210220.
The previous prime is 2120102210203. The next prime is 2120102210227. The reversal of 2120102210221 is 1220122010212.
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., 1475044256196 + 645057954025 = 1214514^2 + 803155^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2120102210221 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2120102210195 and 2120102210204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2120102210227) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1060051105110 + 1060051105111.
It is an arithmetic number, because the mean of its divisors is an integer number (1060051105111).
Almost surely, 22120102210221 is an apocalyptic number.
It is an amenable number.
2120102210221 is a deficient number, since it is larger than the sum of its proper divisors (1).
2120102210221 is an equidigital number, since it uses as much as digits as its factorization.
2120102210221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 2120102210221 its reverse (1220122010212), we get a palindrome (3340224220433).
The spelling of 2120102210221 in words is "two trillion, one hundred twenty billion, one hundred two million, two hundred ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •