Search a number
-
+
415023332535151 is a prime number
BaseRepresentation
bin101111001011101100010011…
…0010011110010101101101111
32000102110211202121220002102221
41132113120212103302231233
5413344220241112111101
64030403030433500211
7153263306034325654
oct13627304623625557
92012424677802387
10415023332535151
1111026a45264217a
123a66a376411667
1314a766bc6a9342
14746b344c4dc2b
1532eaa98d8baa1
hex17976264f2b6f

415023332535151 has 2 divisors, whose sum is σ = 415023332535152. Its totient is φ = 415023332535150.

The previous prime is 415023332535107. The next prime is 415023332535169. The reversal of 415023332535151 is 151535233320514.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 415023332535151 - 221 = 415023330437999 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 2415023332535151 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 810000, while the sum is 43.

Adding to 415023332535151 its reverse (151535233320514), we get a palindrome (566558565855665).

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