Search a number
-
+
21507526503941 is a prime number
BaseRepresentation
bin1001110001111100111000…
…11110100010111000000101
32211011002200111112122210112
410320332130132202320011
510304334403241111231
6113424230555002405
74346603361621422
oct470763436427005
984132614478715
1021507526503941
116942322014215
1224b4377139405
13c001c6b07c6a
14544d81338d49
152746d7d9a92b
hex138f9c7a2e05

21507526503941 has 2 divisors, whose sum is σ = 21507526503942. Its totient is φ = 21507526503940.

The previous prime is 21507526503937. The next prime is 21507526504003. The reversal of 21507526503941 is 14930562570512.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 18460857492100 + 3046669011841 = 4296610^2 + 1745471^2 .

It is a cyclic number.

It is not a de Polignac number, because 21507526503941 - 22 = 21507526503937 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 221507526503941 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2268000, while the sum is 50.

The spelling of 21507526503941 in words is "twenty-one trillion, five hundred seven billion, five hundred twenty-six million, five hundred three thousand, nine hundred forty-one".