Base | Representation |
---|---|
bin | 11110110110100001001… |
… | …000110100100001101001 |
3 | 21111200101222012000022222 |
4 | 132312201020310201221 |
5 | 234214002303233001 |
6 | 4301545403123425 |
7 | 306113415246326 |
oct | 36664110644151 |
9 | 7450358160288 |
10 | 2120122321001 |
11 | 748158862543 |
12 | 2a2a88813575 |
13 | 124c07ba8c19 |
14 | 74886157b4d |
15 | 3a238a9661b |
hex | 1eda1234869 |
2120122321001 has 2 divisors, whose sum is σ = 2120122321002. Its totient is φ = 2120122321000.
The previous prime is 2120122320997. The next prime is 2120122321007. The reversal of 2120122321001 is 1001232210212.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1462887831001 + 657234490000 = 1209499^2 + 810700^2 .
It is a cyclic number.
It is not a de Polignac number, because 2120122321001 - 22 = 2120122320997 is a prime.
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 (2120122321007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1060061160500 + 1060061160501.
It is an arithmetic number, because the mean of its divisors is an integer number (1060061160501).
Almost surely, 22120122321001 is an apocalyptic number.
It is an amenable number.
2120122321001 is a deficient number, since it is larger than the sum of its proper divisors (1).
2120122321001 is an equidigital number, since it uses as much as digits as its factorization.
2120122321001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 2120122321001 its reverse (1001232210212), we get a palindrome (3121354531213).
The spelling of 2120122321001 in words is "two trillion, one hundred twenty billion, one hundred twenty-two million, three hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •