Search a number
-
+
409392098153 is a prime number
BaseRepresentation
bin1011111010100011010…
…10111010101101101001
31110010201020110101112222
411331101222322231221
523201413334120103
6512023325243425
741402055263243
oct5752152725551
91403636411488
10409392098153
11148693191795
1267414703575
132c7b43c437c
1415b596c3093
15a9b1227638
hex5f51abab69

409392098153 has 2 divisors, whose sum is σ = 409392098154. Its totient is φ = 409392098152.

The previous prime is 409392097973. The next prime is 409392098161. The reversal of 409392098153 is 351890293904.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 315076774489 + 94315323664 = 561317^2 + 307108^2 .

It is a cyclic number.

It is not a de Polignac number, because 409392098153 - 226 = 409324989289 is a prime.

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

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

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

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

Almost surely, 2409392098153 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2099520, while the sum is 53.

The spelling of 409392098153 in words is "four hundred nine billion, three hundred ninety-two million, ninety-eight thousand, one hundred fifty-three".