Base | Representation |
---|---|
bin | 111000111101001001… |
… | …1110111011001110101 |
3 | 102200201001221021120122 |
4 | 1301322103313121311 |
5 | 4000443121043214 |
6 | 132104451341325 |
7 | 11556661205111 |
oct | 1617223673165 |
9 | 380631837518 |
10 | 122311112309 |
11 | 47965485aa1 |
12 | 1b8558b1845 |
13 | b6c2c50449 |
14 | 5cc4268741 |
15 | 32acd1e88e |
hex | 1c7a4f7675 |
122311112309 has 2 divisors, whose sum is σ = 122311112310. Its totient is φ = 122311112308.
The previous prime is 122311112299. The next prime is 122311112393. The reversal of 122311112309 is 903211113221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 74581971409 + 47729140900 = 273097^2 + 218470^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-122311112309 is a prime.
It is a super-2 number, since 2×1223111123092 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122311112909) 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, 61155556154 + 61155556155.
It is an arithmetic number, because the mean of its divisors is an integer number (61155556155).
Almost surely, 2122311112309 is an apocalyptic number.
It is an amenable number.
122311112309 is a deficient number, since it is larger than the sum of its proper divisors (1).
122311112309 is an equidigital number, since it uses as much as digits as its factorization.
122311112309 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 26.
The spelling of 122311112309 in words is "one hundred twenty-two billion, three hundred eleven million, one hundred twelve thousand, three hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •