151065701041 has 2 divisors, whose sum is σ = 151065701042. Its totient is φ = 151065701040.

The previous prime is 151065701029. The next prime is 151065701047. The reversal of 151065701041 is 140107560151.

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

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 83798091441 + 67267609600 = 289479^2 + 259360^2 .

It is a cyclic number.

It is not a de Polignac number, because 151065701041 - 2⁷ = 151065700913 is a prime.

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

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

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

Almost surely, 2^151065701041 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4200, while the sum is 31.

The spelling of 151065701041 in words is "one hundred fifty-one billion, sixty-five million, seven hundred one thousand, forty-one".