Search a number
-
+
353415056053 is a prime number
BaseRepresentation
bin1010010010010010010…
…11011100101010110101
31020210020002210000120111
411021021023130222311
521242243223243203
6430205011103021
734350645260623
oct5111113345265
91223202700514
10353415056053
11126978649524
12585b1ba1a71
1327433266457
141316923c513
1592d6c8226d
hex52492dcab5

353415056053 has 2 divisors, whose sum is σ = 353415056054. Its totient is φ = 353415056052.

The previous prime is 353415056047. The next prime is 353415056083. The reversal of 353415056053 is 350650514353.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 254880590449 + 98534465604 = 504857^2 + 313902^2 .

It is a cyclic number.

It is not a de Polignac number, because 353415056053 - 29 = 353415055541 is a prime.

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 2353415056053 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 405000, while the sum is 40.

The spelling of 353415056053 in words is "three hundred fifty-three billion, four hundred fifteen million, fifty-six thousand, fifty-three".