10256161567 has 4 divisors (see below), whose sum is σ = 10298718496. Its totient is φ = 10213604640.

The previous prime is 10256161561. The next prime is 10256161577. The reversal of 10256161567 is 76516165201.

10256161567 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 76516165201 = 7 ⋅10930880743.

It is a cyclic number.

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

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (10256161561) by changing a digit.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 21278103 + ... + 21278584.

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

Almost surely, 2^10256161567 is an apocalyptic number.

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

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

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

The sum of its prime factors is 42556928.

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

The spelling of 10256161567 in words is "ten billion, two hundred fifty-six million, one hundred sixty-one thousand, five hundred sixty-seven".