Base | Representation |
---|---|
bin | 100000100011010000101110… |
… | …100001000011000010101101 |
3 | 200202220000121110210210222012 |
4 | 200203100232201003002231 |
5 | 122231020432330403141 |
6 | 1224251030255531005 |
7 | 42104004606550622 |
oct | 4043205641030255 |
9 | 622800543723865 |
10 | 143160630325421 |
11 | 4168509a6a0985 |
12 | 140815a5529a65 |
13 | 61b5cb2c62c27 |
14 | 274d0236d6349 |
15 | 1183e0abcaceb |
hex | 82342e8430ad |
143160630325421 has 2 divisors, whose sum is σ = 143160630325422. Its totient is φ = 143160630325420.
The previous prime is 143160630325409. The next prime is 143160630325441. The reversal of 143160630325421 is 124523036061341.
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., 123654177600100 + 19506452725321 = 11119990^2 + 4416611^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-143160630325421 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (143160630325441) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71580315162710 + 71580315162711.
It is an arithmetic number, because the mean of its divisors is an integer number (71580315162711).
Almost surely, 2143160630325421 is an apocalyptic number.
It is an amenable number.
143160630325421 is a deficient number, since it is larger than the sum of its proper divisors (1).
143160630325421 is an equidigital number, since it uses as much as digits as its factorization.
143160630325421 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 311040, while the sum is 41.
Adding to 143160630325421 its reverse (124523036061341), we get a palindrome (267683666386762).
The spelling of 143160630325421 in words is "one hundred forty-three trillion, one hundred sixty billion, six hundred thirty million, three hundred twenty-five thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •