Base | Representation |
---|---|
bin | 11110110110100001001… |
… | …000011100000111100101 |
3 | 21111200101221222221012022 |
4 | 132312201020130013211 |
5 | 234214002242033104 |
6 | 4301545401032525 |
7 | 306113414352011 |
oct | 36664110340745 |
9 | 7450357887168 |
10 | 2120122221029 |
11 | 7481587a441a |
12 | 2a2a88785745 |
13 | 124c07b72577 |
14 | 7488612d541 |
15 | 3a238a76bbe |
hex | 1eda121c1e5 |
2120122221029 has 2 divisors, whose sum is σ = 2120122221030. Its totient is φ = 2120122221028.
The previous prime is 2120122220989. The next prime is 2120122221031. The reversal of 2120122221029 is 9201222210212.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1081812170404 + 1038310050625 = 1040102^2 + 1018975^2 .
It is a cyclic number.
It is not a de Polignac number, because 2120122221029 - 228 = 2119853785573 is a prime.
It is a Sophie Germain prime.
Together with 2120122221031, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2120122220989 and 2120122221007.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2120122221629) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1060061110514 + 1060061110515.
It is an arithmetic number, because the mean of its divisors is an integer number (1060061110515).
Almost surely, 22120122221029 is an apocalyptic number.
It is an amenable number.
2120122221029 is a deficient number, since it is larger than the sum of its proper divisors (1).
2120122221029 is an equidigital number, since it uses as much as digits as its factorization.
2120122221029 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1152, while the sum is 26.
The spelling of 2120122221029 in words is "two trillion, one hundred twenty billion, one hundred twenty-two million, two hundred twenty-one thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •