10150370960011 has 2 divisors, whose sum is σ = 10150370960012. Its totient is φ = 10150370960010.

The previous prime is 10150370959979. The next prime is 10150370960047. The reversal of 10150370960011 is 11006907305101.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 10150370960011 - 2⁵ = 10150370959979 is a prime.

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

It is not a weakly prime, because it can be changed into another prime (10150370960111) 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, 5075185480005 + 5075185480006.

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

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

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

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

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

The product of its (nonzero) digits is 5670, while the sum is 34.

The spelling of 10150370960011 in words is "ten trillion, one hundred fifty billion, three hundred seventy million, nine hundred sixty thousand, eleven".