Search a number
-
+
143330662466161 is a prime number
BaseRepresentation
bin100000100101101111000101…
…001110001100001001110001
3200210111021111022021111220021
4200211233011032030021301
5122241312144042404121
61224501110342443441
742122204301111562
oct4045570516141161
9623437438244807
10143330662466161
1141740213380945
12140aa538a33581
1361c903c7614b1
142757353738169
15118855d274641
hex825bc538c271

143330662466161 has 2 divisors, whose sum is σ = 143330662466162. Its totient is φ = 143330662466160.

The previous prime is 143330662466137. The next prime is 143330662466191. The reversal of 143330662466161 is 161664266033341.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 123533110557025 + 19797551909136 = 11114545^2 + 4449444^2 .

It is a cyclic number.

It is not a de Polignac number, because 143330662466161 - 25 = 143330662466129 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 143330662466099 and 143330662466108.

It is not a weakly prime, because it can be changed into another prime (143330662466191) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71665331233080 + 71665331233081.

It is an arithmetic number, because the mean of its divisors is an integer number (71665331233081).

Almost surely, 2143330662466161 is an apocalyptic number.

It is an amenable number.

143330662466161 is a deficient number, since it is larger than the sum of its proper divisors (1).

143330662466161 is an equidigital number, since it uses as much as digits as its factorization.

143330662466161 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 6718464, while the sum is 52.

The spelling of 143330662466161 in words is "one hundred forty-three trillion, three hundred thirty billion, six hundred sixty-two million, four hundred sixty-six thousand, one hundred sixty-one".