1065151106141 has 2 divisors, whose sum is σ = 1065151106142. Its totient is φ = 1065151106140.

The previous prime is 1065151106137. The next prime is 1065151106147. The reversal of 1065151106141 is 1416011515601.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1055776800100 + 9374306041 = 1027510^2 + 96821^2 .

It is a cyclic number.

It is not a de Polignac number, because 1065151106141 - 2² = 1065151106137 is a prime.

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

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

It is a congruent number.

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

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

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

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

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3600, while the sum is 32.

The spelling of 1065151106141 in words is "one trillion, sixty-five billion, one hundred fifty-one million, one hundred six thousand, one hundred forty-one".