10133100041111 has 2 divisors, whose sum is σ = 10133100041112. Its totient is φ = 10133100041110.

The previous prime is 10133100041093. The next prime is 10133100041153. The reversal of 10133100041111 is 11114000133101.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 10133100041111 - 2³⁰ = 10132026299287 is a prime.

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

It is a Sophie Germain prime.

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

It is a congruent number.

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

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

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

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

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

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

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

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

The product of its (nonzero) digits is 36, while the sum is 17.

Adding to 10133100041111 its reverse (11114000133101), we get a palindrome (21247100174212).

The spelling of 10133100041111 in words is "ten trillion, one hundred thirty-three billion, one hundred million, forty-one thousand, one hundred eleven".