Search a number
-
+
415252130437 is a prime number
BaseRepresentation
bin1100000101011101111…
…01001010101010000101
31110200211122010212121201
412002232331022222011
523300414021133222
6514433022142501
742000222604414
oct6025675125205
91420748125551
10415252130437
11150120002781
126858b121a31
13302094946b1
1416153a9947b
15ac05913427
hex60aef4aa85

415252130437 has 2 divisors, whose sum is σ = 415252130438. Its totient is φ = 415252130436.

The previous prime is 415252130429. The next prime is 415252130441. The reversal of 415252130437 is 734031252514.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 369470681281 + 45781449156 = 607841^2 + 213966^2 .

It is a cyclic number.

It is not a de Polignac number, because 415252130437 - 23 = 415252130429 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2415252130437 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 100800, while the sum is 37.

The spelling of 415252130437 in words is "four hundred fifteen billion, two hundred fifty-two million, one hundred thirty thousand, four hundred thirty-seven".