110100000001000 has 128 divisors (see below), whose sum is σ = 258504214419360. Its totient is φ = 43891381248000.

The previous prime is 110100000000989. The next prime is 110100000001007. The reversal of 110100000001000 is 100000001011.

It can be written as a sum of positive squares in 16 ways, for example, as 55958688146916 + 54141311854084 = 7480554^2 + 7358078^2 .

It is a Harshad number since it is a multiple of its sum of digits (4).

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

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

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

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 110100000001000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (129252107209680).

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

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

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

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

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

The product of its (nonzero) digits is 1, while the sum is 4.

Adding to 110100000001000 its reverse (100000001011), we get a palindrome (110200000002011).

The spelling of 110100000001000 in words is "one hundred ten trillion, one hundred billion, one thousand".