Base | Representation |
---|---|
bin | 11011110000110011110110… |
… | …111100001000011101000001 |
3 | 121000022210020121110000222022 |
4 | 123300303312330020131001 |
5 | 112001002304122432324 |
6 | 1111404350433451225 |
7 | 34501353222111455 |
oct | 3360636674103501 |
9 | 530283217400868 |
10 | 122101473249089 |
11 | 359a5a42519a24 |
12 | 11840100410b15 |
13 | 53191727878a9 |
14 | 2221a584bc665 |
15 | e1b215d8105e |
hex | 6f0cf6f08741 |
122101473249089 has 2 divisors, whose sum is σ = 122101473249090. Its totient is φ = 122101473249088.
The previous prime is 122101473249047. The next prime is 122101473249121. The reversal of 122101473249089 is 980942374101221.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 115733380623025 + 6368092626064 = 10757945^2 + 2523508^2 .
It is a cyclic number.
It is not a de Polignac number, because 122101473249089 - 236 = 122032753772353 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 122101473249089.
It is not a weakly prime, because it can be changed into another prime (122101473249029) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61050736624544 + 61050736624545.
It is an arithmetic number, because the mean of its divisors is an integer number (61050736624545).
Almost surely, 2122101473249089 is an apocalyptic number.
It is an amenable number.
122101473249089 is a deficient number, since it is larger than the sum of its proper divisors (1).
122101473249089 is an equidigital number, since it uses as much as digits as its factorization.
122101473249089 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1741824, while the sum is 53.
The spelling of 122101473249089 in words is "one hundred twenty-two trillion, one hundred one billion, four hundred seventy-three million, two hundred forty-nine thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •