1070232151567 has 2 divisors, whose sum is σ = 1070232151568. Its totient is φ = 1070232151566.

The previous prime is 1070232151523. The next prime is 1070232151591. The reversal of 1070232151567 is 7651512320701.

It is a strong prime.

It is a cyclic number.

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

It is a super-2 number, since 2×1070232151567² (a number of 25 digits) contains 22 as substring.

It is a congruent number.

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

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

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

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

Almost surely, 2^{1070232151567} is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 88200, while the sum is 40.

The spelling of 1070232151567 in words is "one trillion, seventy billion, two hundred thirty-two million, one hundred fifty-one thousand, five hundred sixty-seven".