Search a number
-
+
870641001388567 is a prime number
BaseRepresentation
bin1100010111110101111110011…
…1100111010101101000010111
311020011200110121100100101221101
43011331133213213111220113
51403104040232323413232
612323410542053530531
7351246510434263033
oct30575374747255027
94204613540311841
10870641001388567
1123245a8587a1002
1281794085943a47
132b4a612bab7466
14114dd36c1591c3
156a9c5854601e7
hex317d7e79d5a17

870641001388567 has 2 divisors, whose sum is σ = 870641001388568. Its totient is φ = 870641001388566.

The previous prime is 870641001388531. The next prime is 870641001388589. The reversal of 870641001388567 is 765883100146078.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 870641001388567 - 227 = 870640867170839 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 2870641001388567 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 54190080, while the sum is 64.

The spelling of 870641001388567 in words is "eight hundred seventy trillion, six hundred forty-one billion, one million, three hundred eighty-eight thousand, five hundred sixty-seven".