Base | Representation |
---|---|
bin | 1011110010100110011001… |
… | …0111110100001010001101 |
3 | 1200220100011111012122022112 |
4 | 2330221212113310022031 |
5 | 3144400111234141232 |
6 | 43323314025553405 |
7 | 2505420145536401 |
oct | 274514627641215 |
9 | 50810144178275 |
10 | 12963928818317 |
11 | 4148a75938044 |
12 | 15545b5645865 |
13 | 730654863c29 |
14 | 32b65955d101 |
15 | 17734ca644b2 |
hex | bca665f428d |
12963928818317 has 2 divisors, whose sum is σ = 12963928818318. Its totient is φ = 12963928818316.
The previous prime is 12963928818301. The next prime is 12963928818319. The reversal of 12963928818317 is 71381882936921.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12941135669641 + 22793148676 = 3597379^2 + 150974^2 .
It is a cyclic number.
It is not a de Polignac number, because 12963928818317 - 24 = 12963928818301 is a prime.
Together with 12963928818319, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12963928818319) 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, 6481964409158 + 6481964409159.
It is an arithmetic number, because the mean of its divisors is an integer number (6481964409159).
Almost surely, 212963928818317 is an apocalyptic number.
It is an amenable number.
12963928818317 is a deficient number, since it is larger than the sum of its proper divisors (1).
12963928818317 is an equidigital number, since it uses as much as digits as its factorization.
12963928818317 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 62705664, while the sum is 68.
The spelling of 12963928818317 in words is "twelve trillion, nine hundred sixty-three billion, nine hundred twenty-eight million, eight hundred eighteen thousand, three hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •