Base | Representation |
---|---|
bin | 11110111000100011100… |
… | …011010011101101000001 |
3 | 21111220001110020222201212 |
4 | 132320203203103231001 |
5 | 234232442414140104 |
6 | 4302550443135505 |
7 | 306221553631244 |
oct | 36704343235501 |
9 | 7456043228655 |
10 | 2122310302529 |
11 | 74908092343a |
12 | 2a3399514595 |
13 | 125196290051 |
14 | 74a1298725b |
15 | 3a315bdc36e |
hex | 1ee238d3b41 |
2122310302529 has 2 divisors, whose sum is σ = 2122310302530. Its totient is φ = 2122310302528.
The previous prime is 2122310302493. The next prime is 2122310302531. The reversal of 2122310302529 is 9252030132212.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2122149697600 + 160604929 = 1456760^2 + 12673^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2122310302529 is a prime.
It is a Sophie Germain prime.
Together with 2122310302531, 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 = 2122310302495 and 2122310302504.
It is not a weakly prime, because it can be changed into another prime (2122310302129) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1061155151264 + 1061155151265.
It is an arithmetic number, because the mean of its divisors is an integer number (1061155151265).
Almost surely, 22122310302529 is an apocalyptic number.
It is an amenable number.
2122310302529 is a deficient number, since it is larger than the sum of its proper divisors (1).
2122310302529 is an equidigital number, since it uses as much as digits as its factorization.
2122310302529 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12960, while the sum is 32.
The spelling of 2122310302529 in words is "two trillion, one hundred twenty-two billion, three hundred ten million, three hundred two thousand, five hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •