Base | Representation |
---|---|
bin | 11011110011110111000101… |
… | …111111011100011001000011 |
3 | 121001001211100020101021011212 |
4 | 123303313011333130121003 |
5 | 112012421120442243412 |
6 | 1112044540211000335 |
7 | 34522454133213005 |
oct | 3363670577343103 |
9 | 531054306337155 |
10 | 122311105431107 |
11 | 35a7693741002a |
12 | 118748658990ab |
13 | 5332b7050cb48 |
14 | 222bc63938375 |
15 | e218d4c5a222 |
hex | 6f3dc5fdc643 |
122311105431107 has 2 divisors, whose sum is σ = 122311105431108. Its totient is φ = 122311105431106.
The previous prime is 122311105431101. The next prime is 122311105431139. The reversal of 122311105431107 is 701134501113221.
It is an a-pointer prime, because the next prime (122311105431139) can be obtained adding 122311105431107 to its sum of digits (32).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 122311105431107 - 28 = 122311105430851 is a prime.
It is not a weakly prime, because it can be changed into another prime (122311105431101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61155552715553 + 61155552715554.
It is an arithmetic number, because the mean of its divisors is an integer number (61155552715554).
Almost surely, 2122311105431107 is an apocalyptic number.
122311105431107 is a deficient number, since it is larger than the sum of its proper divisors (1).
122311105431107 is an equidigital number, since it uses as much as digits as its factorization.
122311105431107 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5040, while the sum is 32.
Adding to 122311105431107 its reverse (701134501113221), we get a palindrome (823445606544328).
The spelling of 122311105431107 in words is "one hundred twenty-two trillion, three hundred eleven billion, one hundred five million, four hundred thirty-one thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •