Search a number
-
+
405997269169 is a prime number
BaseRepresentation
bin1011110100001110101…
…00101011000010110001
31102210221122111012200011
411322013110223002301
523122440300103134
6510302414254521
741221663563532
oct5720724530261
91383848435604
10405997269169
111472009684a8
12668277b7441
132c392c8c11b
14159168a0689
15a863192264
hex5e8752b0b1

405997269169 has 2 divisors, whose sum is σ = 405997269170. Its totient is φ = 405997269168.

The previous prime is 405997269113. The next prime is 405997269191. The reversal of 405997269169 is 961962799504.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 231853806144 + 174143463025 = 481512^2 + 417305^2 .

It is a cyclic number.

It is not a de Polignac number, because 405997269169 - 217 = 405997138097 is a prime.

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

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

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

Almost surely, 2405997269169 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 66134880, while the sum is 67.

The spelling of 405997269169 in words is "four hundred five billion, nine hundred ninety-seven million, two hundred sixty-nine thousand, one hundred sixty-nine".