11010111313000 has 32 divisors (see below), whose sum is σ = 25763660474760. Its totient is φ = 4404044524800.

The previous prime is 11010111312971. The next prime is 11010111313009. The reversal of 11010111313000 is 31311101011.

It can be written as a sum of positive squares in 4 ways, for example, as 2095933734756 + 8914177578244 = 1447734^2 + 2985662^2 .

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

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

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

11010111313000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

It is an amenable number.

11010111313000 is an abundant number, since it is smaller than the sum of its proper divisors (14753549161760).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 11010111334 (or 11010111320 counting only the distinct ones).

The product of its (nonzero) digits is 9, while the sum is 13.

Adding to 11010111313000 its reverse (31311101011), we get a palindrome (11041422414011).

The spelling of 11010111313000 in words is "eleven trillion, ten billion, one hundred eleven million, three hundred thirteen thousand".