1064141011 has 2 divisors, whose sum is σ = 1064141012. Its totient is φ = 1064141010.

The previous prime is 1064140997. The next prime is 1064141017. The reversal of 1064141011 is 1101414601.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 1064141011 - 2⁹ = 1064140499 is a prime.

It is a super-2 number, since 2×1064141011² = 2264792182584204242, which contains 22 as substring.

It is a self number, because there is not a number n which added to its sum of digits gives 1064141011.

It is not a weakly prime, because it can be changed into another prime (1064141017) 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 as a sum of consecutive naturals, namely, 532070505 + 532070506.

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

Almost surely, 2^1064141011 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 96, while the sum is 19.

The square root of 1064141011 is about 32621.1742737750. The cubic root of 1064141011 is about 1020.9388417965.

Adding to 1064141011 its reverse (1101414601), we get a palindrome (2165555612).

The spelling of 1064141011 in words is "one billion, sixty-four million, one hundred forty-one thousand, eleven".