Base | Representation |
---|---|
bin | 100011100110001100001100… |
… | …0001110010101001111011001 |
3 | 1112001122020002110101011000022 |
4 | 1013030120120032111033121 |
5 | 312020012101212120233 |
6 | 3025533415114520225 |
7 | 122644414013435153 |
oct | 10714303016251731 |
9 | 1461566073334008 |
10 | 313112112223193 |
11 | 90849112596928 |
12 | 2b14b284a36075 |
13 | 1059346506772a |
14 | 57469c838dad3 |
15 | 262eb7076c398 |
hex | 11cc6183953d9 |
313112112223193 has 2 divisors, whose sum is σ = 313112112223194. Its totient is φ = 313112112223192.
The previous prime is 313112112223177. The next prime is 313112112223217. The reversal of 313112112223193 is 391322211211313.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 239165235241024 + 73946876982169 = 15464968^2 + 8599237^2 .
It is a cyclic number.
It is not a de Polignac number, because 313112112223193 - 24 = 313112112223177 is a prime.
It is not a weakly prime, because it can be changed into another prime (313112112223103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 156556056111596 + 156556056111597.
It is an arithmetic number, because the mean of its divisors is an integer number (156556056111597).
Almost surely, 2313112112223193 is an apocalyptic number.
It is an amenable number.
313112112223193 is a deficient number, since it is larger than the sum of its proper divisors (1).
313112112223193 is an equidigital number, since it uses as much as digits as its factorization.
313112112223193 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 11664, while the sum is 35.
The spelling of 313112112223193 in words is "three hundred thirteen trillion, one hundred twelve billion, one hundred twelve million, two hundred twenty-three thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •