Search a number
-
+
355040212433 is a prime number
BaseRepresentation
bin1010010101010100000…
…10111011010111010001
31020221102100210112000112
411022222002323113101
521304110243244213
6431034143531105
734436141004104
oct5125202732721
91227370715015
10355040212433
11127631a42575
12589862b9a95
1327631b6964a
141328100073b
15937e79eea8
hex52aa0bb5d1

355040212433 has 2 divisors, whose sum is σ = 355040212434. Its totient is φ = 355040212432.

The previous prime is 355040212403. The next prime is 355040212453. The reversal of 355040212433 is 334212040553.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 254225707264 + 100814505169 = 504208^2 + 317513^2 .

It is a cyclic number.

It is not a de Polignac number, because 355040212433 - 228 = 354771776977 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 355040212433.

It is not a weakly prime, because it can be changed into another prime (355040212403) 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, 177520106216 + 177520106217.

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

Almost surely, 2355040212433 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 43200, while the sum is 32.

Adding to 355040212433 its reverse (334212040553), we get a palindrome (689252252986).

The spelling of 355040212433 in words is "three hundred fifty-five billion, forty million, two hundred twelve thousand, four hundred thirty-three".