Base | Representation |
---|---|
bin | 1000010110100010101… |
… | …1101010100000111001 |
3 | 111201101002010021201112 |
4 | 2011220223222200321 |
5 | 4322331442310221 |
6 | 145530220530105 |
7 | 13236551361254 |
oct | 2055053524071 |
9 | 451332107645 |
10 | 143490197561 |
11 | 55943526237 |
12 | 239866b0935 |
13 | 106b99a8959 |
14 | 6d32d9809b |
15 | 3aec34415b |
hex | 2168aea839 |
143490197561 has 2 divisors, whose sum is σ = 143490197562. Its totient is φ = 143490197560.
The previous prime is 143490197527. The next prime is 143490197677. The reversal of 143490197561 is 165791094341.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 132947015161 + 10543182400 = 364619^2 + 102680^2 .
It is an emirp because it is prime and its reverse (165791094341) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 143490197561 - 218 = 143489935417 is a prime.
It is not a weakly prime, because it can be changed into another prime (143490157561) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71745098780 + 71745098781.
It is an arithmetic number, because the mean of its divisors is an integer number (71745098781).
Almost surely, 2143490197561 is an apocalyptic number.
It is an amenable number.
143490197561 is a deficient number, since it is larger than the sum of its proper divisors (1).
143490197561 is an equidigital number, since it uses as much as digits as its factorization.
143490197561 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 816480, while the sum is 50.
The spelling of 143490197561 in words is "one hundred forty-three billion, four hundred ninety million, one hundred ninety-seven thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •