Search a number
-
+
15124324021981 is a prime number
BaseRepresentation
bin1101110000010110011111…
…1101011111011011011101
31222112212112010221001210021
43130011213331133123131
53440244103422200411
652100004000512141
73120460564015066
oct334054775373335
958485463831707
1015124324021981
11490120a690389
12184324161b651
138592aa1b7325
143a40421d956d
151b3642046a71
hexdc167f5f6dd

15124324021981 has 2 divisors, whose sum is σ = 15124324021982. Its totient is φ = 15124324021980.

The previous prime is 15124324021943. The next prime is 15124324022111. The reversal of 15124324021981 is 18912042342151.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 15065529896356 + 58794125625 = 3881434^2 + 242475^2 .

It is a cyclic number.

It is not a de Polignac number, because 15124324021981 - 27 = 15124324021853 is a prime.

It is a super-2 number, since 2×151243240219812 (a number of 27 digits) contains 22 as substring.

It is a congruent number.

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

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

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

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

Almost surely, 215124324021981 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 138240, while the sum is 43.

The spelling of 15124324021981 in words is "fifteen trillion, one hundred twenty-four billion, three hundred twenty-four million, twenty-one thousand, nine hundred eighty-one".