Base | Representation |
---|---|
bin | 11011110010010000101001… |
… | …110100011010010100110001 |
3 | 121000200022102112122212002202 |
4 | 123302100221310122110301 |
5 | 112004120333421022321 |
6 | 1111522225422552545 |
7 | 34511511311006621 |
oct | 3362205164322461 |
9 | 530608375585082 |
10 | 122201111110961 |
11 | 35a3422249a313 |
12 | 11857488a38755 |
13 | 53256912512cc |
14 | 22267cb3d2881 |
15 | e1dae83d570b |
hex | 6f2429d1a531 |
122201111110961 has 2 divisors, whose sum is σ = 122201111110962. Its totient is φ = 122201111110960.
The previous prime is 122201111110943. The next prime is 122201111111029. The reversal of 122201111110961 is 169011111102221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 122097527550625 + 103583560336 = 11049775^2 + 321844^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-122201111110961 is a prime.
It is a super-2 number, since 2×1222011111109612 (a number of 29 digits) contains 22 as substring.
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 (125201111110961) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61100555555480 + 61100555555481.
It is an arithmetic number, because the mean of its divisors is an integer number (61100555555481).
Almost surely, 2122201111110961 is an apocalyptic number.
It is an amenable number.
122201111110961 is a deficient number, since it is larger than the sum of its proper divisors (1).
122201111110961 is an equidigital number, since it uses as much as digits as its factorization.
122201111110961 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 432, while the sum is 29.
The spelling of 122201111110961 in words is "one hundred twenty-two trillion, two hundred one billion, one hundred eleven million, one hundred ten thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •