Base | Representation |
---|---|
bin | 1001000111100110110… |
… | …01100111001110000001 |
3 | 1002221201220011021101021 |
4 | 10203303121213032001 |
5 | 20113140213114131 |
6 | 355534321105441 |
7 | 31431251311321 |
oct | 4436331471601 |
9 | 1087656137337 |
10 | 313321223041 |
11 | 110973731342 |
12 | 50882788281 |
13 | 2371391c3c8 |
14 | 11244407281 |
15 | 823be12e11 |
hex | 48f3667381 |
313321223041 has 2 divisors, whose sum is σ = 313321223042. Its totient is φ = 313321223040.
The previous prime is 313321222999. The next prime is 313321223051. The reversal of 313321223041 is 140322123313.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 291946783041 + 21374440000 = 540321^2 + 146200^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-313321223041 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 313321222997 and 313321223015.
It is not a weakly prime, because it can be changed into another prime (313321223051) 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, 156660611520 + 156660611521.
It is an arithmetic number, because the mean of its divisors is an integer number (156660611521).
Almost surely, 2313321223041 is an apocalyptic number.
It is an amenable number.
313321223041 is a deficient number, since it is larger than the sum of its proper divisors (1).
313321223041 is an equidigital number, since it uses as much as digits as its factorization.
313321223041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 313321223041 its reverse (140322123313), we get a palindrome (453643346354).
The spelling of 313321223041 in words is "three hundred thirteen billion, three hundred twenty-one million, two hundred twenty-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •