105069561151 has 4 divisors (see below), whose sum is σ = 105177769704. Its totient is φ = 104961352600.

The previous prime is 105069561127. The next prime is 105069561167. The reversal of 105069561151 is 151165960501.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 105069561151 - 2⁹ = 105069560639 is a prime.

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

It is a Duffinian number.

It is a congruent number.

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

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

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

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

Almost surely, 2^105069561151 is an apocalyptic number.

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

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

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

The sum of its prime factors is 108208552.

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

The spelling of 105069561151 in words is "one hundred five billion, sixty-nine million, five hundred sixty-one thousand, one hundred fifty-one".