11011465140433 has 8 divisors (see below), whose sum is σ = 11023887890048. Its totient is φ = 10999044532224.

The previous prime is 11011465140371. The next prime is 11011465140437. The reversal of 11011465140433 is 33404156411011.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 11011465140433 - 2⁹ = 11011465139921 is a prime.

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

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (11011465140437) 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 in 7 ways as a sum of consecutive naturals, for example, 9868660 + ... + 10927642.

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

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

It is an amenable number.

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

11011465140433 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 1070703.

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

The spelling of 11011465140433 in words is "eleven trillion, eleven billion, four hundred sixty-five million, one hundred forty thousand, four hundred thirty-three".