Base | Representation |
---|---|
bin | 11011110011111000111101… |
… | …100000010111011010000111 |
3 | 121001002000111222100212102011 |
4 | 123303320331200113122013 |
5 | 112012434222300101101 |
6 | 1112045511155355051 |
7 | 34522554621355063 |
oct | 3363707540273207 |
9 | 531060458325364 |
10 | 122313110550151 |
11 | 35a77776233704 |
12 | 118751252b2a87 |
13 | 53330cca5a211 |
14 | 222bdb3d66aa3 |
15 | e219a0cce751 |
hex | 6f3e3d817687 |
122313110550151 has 2 divisors, whose sum is σ = 122313110550152. Its totient is φ = 122313110550150.
The previous prime is 122313110550149. The next prime is 122313110550157. The reversal of 122313110550151 is 151055011313221.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 122313110550151 - 21 = 122313110550149 is a prime.
It is a super-2 number, since 2×1223131105501512 (a number of 29 digits) contains 22 as substring.
Together with 122313110550149, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122313110550157) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61156555275075 + 61156555275076.
It is an arithmetic number, because the mean of its divisors is an integer number (61156555275076).
Almost surely, 2122313110550151 is an apocalyptic number.
122313110550151 is a deficient number, since it is larger than the sum of its proper divisors (1).
122313110550151 is an equidigital number, since it uses as much as digits as its factorization.
122313110550151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4500, while the sum is 31.
Adding to 122313110550151 its reverse (151055011313221), we get a palindrome (273368121863372).
The spelling of 122313110550151 in words is "one hundred twenty-two trillion, three hundred thirteen billion, one hundred ten million, five hundred fifty thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •