Search a number
-
+
15274904797 is a prime number
BaseRepresentation
bin11100011100111010…
…01000110011011101
31110102112102120011201
432032131020303131
5222240333423142
611003414115501
71050345356065
oct161635106335
943375376151
1015274904797
116529316069
122b6364bb91
13159579b509
14a4c9443a5
155e6017ab7
hex38e748cdd

15274904797 has 2 divisors, whose sum is σ = 15274904798. Its totient is φ = 15274904796.

The previous prime is 15274904779. The next prime is 15274904849. The reversal of 15274904797 is 79740947251.

Together with previous prime (15274904779) 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., 15053817636 + 221087161 = 122694^2 + 14869^2 .

It is a cyclic number.

It is not a de Polignac number, because 15274904797 - 211 = 15274902749 is a prime.

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

It is a congruent number.

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

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

Almost surely, 215274904797 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4445280, while the sum is 55.

The spelling of 15274904797 in words is "fifteen billion, two hundred seventy-four million, nine hundred four thousand, seven hundred ninety-seven".