Base | Representation |
---|---|
bin | 11110110110100110010… |
… | …111110000010100100101 |
3 | 21111200122002101202200121 |
4 | 132312212113300110211 |
5 | 234214142242401041 |
6 | 4302002221041541 |
7 | 306115532453065 |
oct | 36664627602445 |
9 | 7450562352617 |
10 | 2120210122021 |
11 | 7481a3381772 |
12 | 2a2ab20b62b1 |
13 | 124c2013aca4 |
14 | 74893a913a5 |
15 | 3a24163b7d1 |
hex | 1eda65f0525 |
2120210122021 has 2 divisors, whose sum is σ = 2120210122022. Its totient is φ = 2120210122020.
The previous prime is 2120210122001. The next prime is 2120210122033. The reversal of 2120210122021 is 1202210120212.
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., 2112516902500 + 7693219521 = 1453450^2 + 87711^2 .
It is a cyclic number.
It is not a de Polignac number, because 2120210122021 - 25 = 2120210121989 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2120210121986 and 2120210122004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2120210122001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1060105061010 + 1060105061011.
It is an arithmetic number, because the mean of its divisors is an integer number (1060105061011).
Almost surely, 22120210122021 is an apocalyptic number.
It is an amenable number.
2120210122021 is a deficient number, since it is larger than the sum of its proper divisors (1).
2120210122021 is an equidigital number, since it uses as much as digits as its factorization.
2120210122021 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 2120210122021 its reverse (1202210120212), we get a palindrome (3322420242233).
The spelling of 2120210122021 in words is "two trillion, one hundred twenty billion, two hundred ten million, one hundred twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •