Search a number
-
+
415023220155569 is a prime number
BaseRepresentation
bin101111001011101100001111…
…1100111000110010010110001
32000102110211110210102121122012
41132113120133213012102301
5413344220023324434234
64030403011341052305
7153263303201163464
oct13627303747062261
92012424423377565
10415023220155569
1111026a3a5165793
123a66a344857095
1314a766a231cb4c
14746b333d592db
1532eaa8e08e0ce
hex179761f9c64b1

415023220155569 has 2 divisors, whose sum is σ = 415023220155570. Its totient is φ = 415023220155568.

The previous prime is 415023220155517. The next prime is 415023220155589. The reversal of 415023220155569 is 965551022320514.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 408032404835344 + 6990815320225 = 20199812^2 + 2644015^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-415023220155569 is a prime.

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

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

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

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

Almost surely, 2415023220155569 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 415023220155569 in words is "four hundred fifteen trillion, twenty-three billion, two hundred twenty million, one hundred fifty-five thousand, five hundred sixty-nine".