Search a number
-
+
143635056322553 is a prime number
BaseRepresentation
bin100000101010001010100100…
…100000100110011111111001
3200211120101012001000120111022
4200222022210200212133321
5122311304043404310203
61225253011155312225
742153201411154205
oct4052124440463771
9624511161016438
10143635056322553
1141848315810514
12141395298ab675
13621b95c981913
142767d8c235b05
151191426556a38
hex82a2a48267f9

143635056322553 has 2 divisors, whose sum is σ = 143635056322554. Its totient is φ = 143635056322552.

The previous prime is 143635056322529. The next prime is 143635056322697. The reversal of 143635056322553 is 355223650536341.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 126475934807104 + 17159121515449 = 11246152^2 + 4142357^2 .

It is a cyclic number.

It is not a de Polignac number, because 143635056322553 - 28 = 143635056322297 is a prime.

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

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

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

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

Almost surely, 2143635056322553 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 29160000, while the sum is 53.

The spelling of 143635056322553 in words is "one hundred forty-three trillion, six hundred thirty-five billion, fifty-six million, three hundred twenty-two thousand, five hundred fifty-three".