Base | Representation |
---|---|
bin | 111000011001011001… |
… | …1000001111000000101 |
3 | 102120121110022121211212 |
4 | 1300302303001320011 |
5 | 3441013444301432 |
6 | 131345431541205 |
7 | 11515152152402 |
oct | 1606263017005 |
9 | 376543277755 |
10 | 121111322117 |
11 | 473aa202955 |
12 | 1b57bb2a805 |
13 | b561500616 |
14 | 5c0cb912a9 |
15 | 323c8262b2 |
hex | 1c32cc1e05 |
121111322117 has 2 divisors, whose sum is σ = 121111322118. Its totient is φ = 121111322116.
The previous prime is 121111322093. The next prime is 121111322141. The reversal of 121111322117 is 711223111121.
It is a balanced prime because it is at equal distance from previous prime (121111322093) and next prime (121111322141).
It can be written as a sum of positive squares in only one way, i.e., 71185441636 + 49925880481 = 266806^2 + 223441^2 .
It is a cyclic number.
It is not a de Polignac number, because 121111322117 - 28 = 121111321861 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 121111322092 and 121111322101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121111321117) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60555661058 + 60555661059.
It is an arithmetic number, because the mean of its divisors is an integer number (60555661059).
Almost surely, 2121111322117 is an apocalyptic number.
It is an amenable number.
121111322117 is a deficient number, since it is larger than the sum of its proper divisors (1).
121111322117 is an equidigital number, since it uses as much as digits as its factorization.
121111322117 is an evil number, because the sum of its binary digits is even.
The product of its digits is 168, while the sum is 23.
Adding to 121111322117 its reverse (711223111121), we get a palindrome (832334433238).
The spelling of 121111322117 in words is "one hundred twenty-one billion, one hundred eleven million, three hundred twenty-two thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •