Base | Representation |
---|---|
bin | 11011110001000111111011… |
… | …010010010010000100101001 |
3 | 121000101211212022100020200221 |
4 | 123301013323102102010221 |
5 | 112001330421334013001 |
6 | 1111422312532530041 |
7 | 34503045210015556 |
oct | 3361077322220451 |
9 | 530354768306627 |
10 | 122123021001001 |
11 | 35a0409a683959 |
12 | 11844314780921 |
13 | 531b1c7a03857 |
14 | 2222b00177a2d |
15 | e1ba7792a1a1 |
hex | 6f11fb492129 |
122123021001001 has 2 divisors, whose sum is σ = 122123021001002. Its totient is φ = 122123021001000.
The previous prime is 122123021000971. The next prime is 122123021001083. The reversal of 122123021001001 is 100100120321221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 120237782159401 + 1885238841600 = 10965299^2 + 1373040^2 .
It is a cyclic number.
It is not a de Polignac number, because 122123021001001 - 213 = 122123020992809 is a prime.
It is not a weakly prime, because it can be changed into another prime (122123021001301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61061510500500 + 61061510500501.
It is an arithmetic number, because the mean of its divisors is an integer number (61061510500501).
Almost surely, 2122123021001001 is an apocalyptic number.
It is an amenable number.
122123021001001 is a deficient number, since it is larger than the sum of its proper divisors (1).
122123021001001 is an equidigital number, since it uses as much as digits as its factorization.
122123021001001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 122123021001001 its reverse (100100120321221), we get a palindrome (222223141322222).
The spelling of 122123021001001 in words is "one hundred twenty-two trillion, one hundred twenty-three billion, twenty-one million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •