Base | Representation |
---|---|
bin | 100011100110111111011011… |
… | …0011101101001110110101001 |
3 | 1112002000202002120100102200212 |
4 | 1013031332312131221312221 |
5 | 312023312421123103223 |
6 | 3030100133142110505 |
7 | 122655360436465151 |
oct | 10715766635516651 |
9 | 1462022076312625 |
10 | 313222141222313 |
11 | 90890845043454 |
12 | 2b16867141b435 |
13 | 105a094b578b7b |
14 | 574c065361761 |
15 | 2632960192278 |
hex | 11cdfb6769da9 |
313222141222313 has 2 divisors, whose sum is σ = 313222141222314. Its totient is φ = 313222141222312.
The previous prime is 313222141222283. The next prime is 313222141222321.
313222141222313 is nontrivially palindromic in base 10.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 298881582628864 + 14340558593449 = 17288192^2 + 3786893^2 .
It is a palprime.
It is a cyclic number.
It is not a de Polignac number, because 313222141222313 - 228 = 313221872786857 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 313222141222313.
It is not a weakly prime, because it can be changed into another prime (313222141222343) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 156611070611156 + 156611070611157.
It is an arithmetic number, because the mean of its divisors is an integer number (156611070611157).
Almost surely, 2313222141222313 is an apocalyptic number.
It is an amenable number.
313222141222313 is a deficient number, since it is larger than the sum of its proper divisors (1).
313222141222313 is an equidigital number, since it uses as much as digits as its factorization.
313222141222313 is an evil number, because the sum of its binary digits is even.
The product of its digits is 20736, while the sum is 32.
The spelling of 313222141222313 in words is "three hundred thirteen trillion, two hundred twenty-two billion, one hundred forty-one million, two hundred twenty-two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •