Base | Representation |
---|---|
bin | 100000100010101110110100… |
… | …010111110000011001110101 |
3 | 200202202112122001212021010121 |
4 | 200202232310113300121311 |
5 | 122224421401130043221 |
6 | 1224222205400451541 |
7 | 42101245425321205 |
oct | 4042566427603165 |
9 | 622675561767117 |
10 | 143124221331061 |
11 | 416707067785a3 |
12 | 14076524179bb1 |
13 | 61b272cb61899 |
14 | 274b36c016405 |
15 | 1182ec95caa41 |
hex | 822bb45f0675 |
143124221331061 has 2 divisors, whose sum is σ = 143124221331062. Its totient is φ = 143124221331060.
The previous prime is 143124221331037. The next prime is 143124221331097. The reversal of 143124221331061 is 160133122421341.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 125126730232036 + 17997491099025 = 11186006^2 + 4242345^2 .
It is a cyclic number.
It is not a de Polignac number, because 143124221331061 - 233 = 143115631396469 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (143124221331011) 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, 71562110665530 + 71562110665531.
It is an arithmetic number, because the mean of its divisors is an integer number (71562110665531).
Almost surely, 2143124221331061 is an apocalyptic number.
It is an amenable number.
143124221331061 is a deficient number, since it is larger than the sum of its proper divisors (1).
143124221331061 is an equidigital number, since it uses as much as digits as its factorization.
143124221331061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20736, while the sum is 34.
The spelling of 143124221331061 in words is "one hundred forty-three trillion, one hundred twenty-four billion, two hundred twenty-one million, three hundred thirty-one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •