Base | Representation |
---|---|
bin | 1001000111001111000… |
… | …10110101001110100001 |
3 | 1002221020000212121021012 |
4 | 10203213202311032201 |
5 | 20112233303004441 |
6 | 355502453510305 |
7 | 31423314514112 |
oct | 4434742651641 |
9 | 1087200777235 |
10 | 313122313121 |
11 | 110881423382 |
12 | 50828042395 |
13 | 236b1657327 |
14 | 11225c2a209 |
15 | 82297219eb |
hex | 48e78b53a1 |
313122313121 has 2 divisors, whose sum is σ = 313122313122. Its totient is φ = 313122313120.
The previous prime is 313122313109. The next prime is 313122313123. The reversal of 313122313121 is 121313221313.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 298674273121 + 14448040000 = 546511^2 + 120200^2 .
It is a cyclic number.
It is not a de Polignac number, because 313122313121 - 226 = 313055204257 is a prime.
Together with 313122313123, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (313122313123) 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, 156561156560 + 156561156561.
It is an arithmetic number, because the mean of its divisors is an integer number (156561156561).
Almost surely, 2313122313121 is an apocalyptic number.
It is an amenable number.
313122313121 is a deficient number, since it is larger than the sum of its proper divisors (1).
313122313121 is an equidigital number, since it uses as much as digits as its factorization.
313122313121 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 648, while the sum is 23.
Adding to 313122313121 its reverse (121313221313), we get a palindrome (434435534434).
The spelling of 313122313121 in words is "three hundred thirteen billion, one hundred twenty-two million, three hundred thirteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •