Base | Representation |
---|---|
bin | 111000111100110100… |
… | …1111100000011100001 |
3 | 102200200022020212202201 |
4 | 1301321221330003201 |
5 | 4000432312340223 |
6 | 132103420013201 |
7 | 11556465610306 |
oct | 1617151740341 |
9 | 380608225681 |
10 | 122300121313 |
11 | 4795a259327 |
12 | 1b852091201 |
13 | b6c08a27b6 |
14 | 5cc2a070ad |
15 | 32abd9cead |
hex | 1c79a7c0e1 |
122300121313 has 2 divisors, whose sum is σ = 122300121314. Its totient is φ = 122300121312.
The previous prime is 122300121301. The next prime is 122300121331. The reversal of 122300121313 is 313121003221.
Together with next prime (122300121331) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 62126559504 + 60173561809 = 249252^2 + 245303^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-122300121313 is a prime.
It is not a weakly prime, because it can be changed into another prime (122300124313) 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, 61150060656 + 61150060657.
It is an arithmetic number, because the mean of its divisors is an integer number (61150060657).
Almost surely, 2122300121313 is an apocalyptic number.
It is an amenable number.
122300121313 is a deficient number, since it is larger than the sum of its proper divisors (1).
122300121313 is an equidigital number, since it uses as much as digits as its factorization.
122300121313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 122300121313 its reverse (313121003221), we get a palindrome (435421124534).
The spelling of 122300121313 in words is "one hundred twenty-two billion, three hundred million, one hundred twenty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •