Base | Representation |
---|---|
bin | 111011010000010000011… |
… | …1110110111010000000001 |
3 | 1001211112121012210120210201 |
4 | 1312200200332313100001 |
5 | 2031412011200441421 |
6 | 25153114300125201 |
7 | 1500241144160611 |
oct | 166404076672001 |
9 | 31745535716721 |
10 | 8143811343361 |
11 | 265a853216021 |
12 | ab63a9b36801 |
13 | 470c5bc926c5 |
14 | 20223c152a41 |
15 | e1c8c593b91 |
hex | 76820fb7401 |
8143811343361 has 2 divisors, whose sum is σ = 8143811343362. Its totient is φ = 8143811343360.
The previous prime is 8143811343313. The next prime is 8143811343391. The reversal of 8143811343361 is 1633431183418.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8032372212736 + 111439130625 = 2834144^2 + 333825^2 .
It is a cyclic number.
It is not a de Polignac number, because 8143811343361 - 225 = 8143777788929 is a prime.
It is a super-3 number, since 3×81438113433613 (a number of 40 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (8143811343301) 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, 4071905671680 + 4071905671681.
It is an arithmetic number, because the mean of its divisors is an integer number (4071905671681).
Almost surely, 28143811343361 is an apocalyptic number.
It is an amenable number.
8143811343361 is a deficient number, since it is larger than the sum of its proper divisors (1).
8143811343361 is an equidigital number, since it uses as much as digits as its factorization.
8143811343361 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 497664, while the sum is 46.
The spelling of 8143811343361 in words is "eight trillion, one hundred forty-three billion, eight hundred eleven million, three hundred forty-three thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •