Search a number
-
+
353530025213 is a prime number
BaseRepresentation
bin1010010010100000000…
…10000001010011111101
31020210112010010001121112
411021100002001103331
521243012141301323
6430224235211405
734353542426651
oct5112002012375
91223463101545
10353530025213
11126a27534562
12586245a6b65
132745101b541
141317a608a61
1592e1de2178
hex52500814fd

353530025213 has 2 divisors, whose sum is σ = 353530025214. Its totient is φ = 353530025212.

The previous prime is 353530025209. The next prime is 353530025231. The reversal of 353530025213 is 312520035353.

Together with next prime (353530025231) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 318036218809 + 35493806404 = 563947^2 + 188398^2 .

It is a cyclic number.

It is not a de Polignac number, because 353530025213 - 22 = 353530025209 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2353530025213 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 353530025213 in words is "three hundred fifty-three billion, five hundred thirty million, twenty-five thousand, two hundred thirteen".