Base | Representation |
---|---|
bin | 100000100010110101101000… |
… | …010100011011100010011101 |
3 | 200202210020111210102200002122 |
4 | 200202311220110123202131 |
5 | 122230031341020402331 |
6 | 1224225415233032325 |
7 | 42101624606253533 |
oct | 4042655024334235 |
9 | 622706453380078 |
10 | 143131535325341 |
11 | 4167381a294772 |
12 | 14077a256b56a5 |
13 | 61b3327225254 |
14 | 274b86354a153 |
15 | 11832a676a17b |
hex | 822d6851b89d |
143131535325341 has 2 divisors, whose sum is σ = 143131535325342. Its totient is φ = 143131535325340.
The previous prime is 143131535325319. The next prime is 143131535325391. The reversal of 143131535325341 is 143523535131341.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 124343775110116 + 18787760215225 = 11150954^2 + 4334485^2 .
It is a cyclic number.
It is not a de Polignac number, because 143131535325341 - 230 = 143130461583517 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 143131535325292 and 143131535325301.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (143131535325391) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71565767662670 + 71565767662671.
It is an arithmetic number, because the mean of its divisors is an integer number (71565767662671).
Almost surely, 2143131535325341 is an apocalyptic number.
It is an amenable number.
143131535325341 is a deficient number, since it is larger than the sum of its proper divisors (1).
143131535325341 is an equidigital number, since it uses as much as digits as its factorization.
143131535325341 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 972000, while the sum is 44.
The spelling of 143131535325341 in words is "one hundred forty-three trillion, one hundred thirty-one billion, five hundred thirty-five million, three hundred twenty-five thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •