Base | Representation |
---|---|
bin | 100000100010110101101000… |
… | …100110011100000110001101 |
3 | 200202210020112010022111221001 |
4 | 200202311220212130012031 |
5 | 122230031343222434341 |
6 | 1224225415522140301 |
7 | 42101624664345166 |
oct | 4042655046340615 |
9 | 622706463274831 |
10 | 143131540046221 |
11 | 41673821a19621 |
12 | 14077a271b1691 |
13 | 61b33281b8c7c |
14 | 274b86401876d |
15 | 11832a6d9dd31 |
hex | 822d6899c18d |
143131540046221 has 2 divisors, whose sum is σ = 143131540046222. Its totient is φ = 143131540046220.
The previous prime is 143131540046207. The next prime is 143131540046249. The reversal of 143131540046221 is 122640045131341.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 132987346896196 + 10144193150025 = 11532014^2 + 3184995^2 .
It is a cyclic number.
It is not a de Polignac number, because 143131540046221 - 25 = 143131540046189 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (143131540046251) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71565770023110 + 71565770023111.
It is an arithmetic number, because the mean of its divisors is an integer number (71565770023111).
Almost surely, 2143131540046221 is an apocalyptic number.
It is an amenable number.
143131540046221 is a deficient number, since it is larger than the sum of its proper divisors (1).
143131540046221 is an equidigital number, since it uses as much as digits as its factorization.
143131540046221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 69120, while the sum is 37.
Adding to 143131540046221 its reverse (122640045131341), we get a palindrome (265771585177562).
The spelling of 143131540046221 in words is "one hundred forty-three trillion, one hundred thirty-one billion, five hundred forty million, forty-six thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •