Base | Representation |
---|---|
bin | 1000010101110111110… |
… | …1000001110011111001 |
3 | 111200220112102110120022 |
4 | 2011131331001303321 |
5 | 4321444402400212 |
6 | 145500310540225 |
7 | 13232234413223 |
oct | 2053575016371 |
9 | 450815373508 |
10 | 143310200057 |
11 | 55860965472 |
12 | 23936367675 |
13 | 1068b605c5b |
14 | 6d17101413 |
15 | 3adb63b772 |
hex | 215df41cf9 |
143310200057 has 2 divisors, whose sum is σ = 143310200058. Its totient is φ = 143310200056.
The previous prime is 143310200021. The next prime is 143310200069. The reversal of 143310200057 is 750002013341.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 134134667536 + 9175532521 = 366244^2 + 95789^2 .
It is a cyclic number.
It is not a de Polignac number, because 143310200057 - 230 = 142236458233 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 143310199999 and 143310200035.
It is not a weakly prime, because it can be changed into another prime (143310200017) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71655100028 + 71655100029.
It is an arithmetic number, because the mean of its divisors is an integer number (71655100029).
Almost surely, 2143310200057 is an apocalyptic number.
It is an amenable number.
143310200057 is a deficient number, since it is larger than the sum of its proper divisors (1).
143310200057 is an equidigital number, since it uses as much as digits as its factorization.
143310200057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2520, while the sum is 26.
Adding to 143310200057 its reverse (750002013341), we get a palindrome (893312213398).
The spelling of 143310200057 in words is "one hundred forty-three billion, three hundred ten million, two hundred thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •