Search a number
-
+
413251409489 is a prime number
BaseRepresentation
bin1100000001101111011…
…01000001011001010001
31110111200012102201102212
412000313231001121101
523232314330100424
6513502311521505
741566520010632
oct6006755013121
91414605381385
10413251409489
1114a293713496
1268111089295
132cc7ab27149
1416004093889
15ab39e5c10e
hex6037b41651

413251409489 has 2 divisors, whose sum is σ = 413251409490. Its totient is φ = 413251409488.

The previous prime is 413251409423. The next prime is 413251409491. The reversal of 413251409489 is 984904152314.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 227369709889 + 185881699600 = 476833^2 + 431140^2 .

It is a cyclic number.

It is not a de Polignac number, because 413251409489 - 224 = 413234632273 is a prime.

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

Together with 413251409491, it forms a pair of twin primes.

It is a Chen prime.

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

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

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

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

Almost surely, 2413251409489 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 413251409489 in words is "four hundred thirteen billion, two hundred fifty-one million, four hundred nine thousand, four hundred eighty-nine".