Search a number
-
+
545255540213 is a prime number
BaseRepresentation
bin1111110111100111100…
…00110100010111110101
31221010101210111100120112
413323303300310113311
532413140404241323
61054253102312405
754251640422666
oct7736360642765
91833353440515
10545255540213
111a02725a06aa
1289810b88705
133c556c91237
141c5677b136d
15e2b3bec178
hex7ef3c345f5

545255540213 has 2 divisors, whose sum is σ = 545255540214. Its totient is φ = 545255540212.

The previous prime is 545255540147. The next prime is 545255540231. The reversal of 545255540213 is 312045552545.

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

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 406810525489 + 138445014724 = 637817^2 + 372082^2 .

It is a cyclic number.

It is not a de Polignac number, because 545255540213 - 210 = 545255539189 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

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

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

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

Almost surely, 2545255540213 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 600000, while the sum is 41.

The spelling of 545255540213 in words is "five hundred forty-five billion, two hundred fifty-five million, five hundred forty thousand, two hundred thirteen".