Search a number
-
+
540701000221 is a prime number
BaseRepresentation
bin1111101111001000100…
…10101000001000011101
31220200122101022202021011
413313210102220020131
532324323424001341
61052221122535221
754031034445514
oct7674422501035
91820571282234
10540701000221
11199345689368
128895b807511
133bcac4cca65
141c25494967b
15e0e8e38b81
hex7de44a821d

540701000221 has 2 divisors, whose sum is σ = 540701000222. Its totient is φ = 540701000220.

The previous prime is 540701000137. The next prime is 540701000227. The reversal of 540701000221 is 122000107045.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 425110520025 + 115590480196 = 652005^2 + 339986^2 .

It is a cyclic number.

It is not a de Polignac number, because 540701000221 - 215 = 540700967453 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2540701000221 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 560, while the sum is 22.

Adding to 540701000221 its reverse (122000107045), we get a palindrome (662701107266).

The spelling of 540701000221 in words is "five hundred forty billion, seven hundred one million, two hundred twenty-one", and thus it is an aban number.