Base | Representation |
---|---|
bin | 11011110001000101011001… |
… | …101101000101111000101101 |
3 | 121000101120212101100020001012 |
4 | 123301011121231011320231 |
5 | 112001304343342314411 |
6 | 1111421143533155005 |
7 | 34502621061633425 |
oct | 3361053155057055 |
9 | 530346771306035 |
10 | 122120310119981 |
11 | 35a02a29435918 |
12 | 1184389892ba65 |
13 | 531ab851aa544 |
14 | 2222924111485 |
15 | e1b96994618b |
hex | 6f1159b45e2d |
122120310119981 has 2 divisors, whose sum is σ = 122120310119982. Its totient is φ = 122120310119980.
The previous prime is 122120310119903. The next prime is 122120310120019. The reversal of 122120310119981 is 189911013021221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 119957913400900 + 2162396719081 = 10952530^2 + 1470509^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-122120310119981 is a prime.
It is a super-2 number, since 2×1221203101199812 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122120310119681) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61060155059990 + 61060155059991.
It is an arithmetic number, because the mean of its divisors is an integer number (61060155059991).
Almost surely, 2122120310119981 is an apocalyptic number.
It is an amenable number.
122120310119981 is a deficient number, since it is larger than the sum of its proper divisors (1).
122120310119981 is an equidigital number, since it uses as much as digits as its factorization.
122120310119981 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15552, while the sum is 41.
The spelling of 122120310119981 in words is "one hundred twenty-two trillion, one hundred twenty billion, three hundred ten million, one hundred nineteen thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •