Search a number
-
+
65561131455031 is a prime number
BaseRepresentation
bin11101110100000101000111…
…11100111001001000110111
322121010120201222100000220001
432322002203330321020313
532043123144123030111
6351234211253252131
716544430645366532
oct1672024374711067
9277116658300801
1065561131455031
1119987357593023
12742a22a334047
132a77507a62704
141229266161a19
1578a5deb561c1
hex3ba0a3f39237

65561131455031 has 2 divisors, whose sum is σ = 65561131455032. Its totient is φ = 65561131455030.

The previous prime is 65561131455013. The next prime is 65561131455041. The reversal of 65561131455031 is 13055413116556.

Together with previous prime (65561131455013) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 65561131455031 - 227 = 65560997237303 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 265561131455031 is an apocalyptic number.

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

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

65561131455031 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 46.

The spelling of 65561131455031 in words is "sixty-five trillion, five hundred sixty-one billion, one hundred thirty-one million, four hundred fifty-five thousand, thirty-one".