Base | Representation |
---|---|
bin | 111000111100110100… |
… | …1111001100100001001 |
3 | 102200200022020100202221 |
4 | 1301321221321210021 |
5 | 4000432312023423 |
6 | 132103415454041 |
7 | 11556465535465 |
oct | 1617151714411 |
9 | 380608210687 |
10 | 122300111113 |
11 | 4795a2516a4 |
12 | 1b852087321 |
13 | b6c089ac6b |
14 | 5cc2a034a5 |
15 | 32abd99e5d |
hex | 1c79a79909 |
122300111113 has 2 divisors, whose sum is σ = 122300111114. Its totient is φ = 122300111112.
The previous prime is 122300111041. The next prime is 122300111123. The reversal of 122300111113 is 311111003221.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 80161464384 + 42138646729 = 283128^2 + 205277^2 .
It is an emirp because it is prime and its reverse (311111003221) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 122300111113 - 221 = 122298013961 is a prime.
It is not a weakly prime, because it can be changed into another prime (122300111123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61150055556 + 61150055557.
It is an arithmetic number, because the mean of its divisors is an integer number (61150055557).
Almost surely, 2122300111113 is an apocalyptic number.
It is an amenable number.
122300111113 is a deficient number, since it is larger than the sum of its proper divisors (1).
122300111113 is an equidigital number, since it uses as much as digits as its factorization.
122300111113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 122300111113 its reverse (311111003221), we get a palindrome (433411114334).
The spelling of 122300111113 in words is "one hundred twenty-two billion, three hundred million, one hundred eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •