Search a number
-
+
11010120000 = 263541119439
BaseRepresentation
bin10100100000100000…
…10001100101000000
31001102022111001021020
422100100101211000
5140022042320000
65020305025440
7536561322135
oct122020214500
931368431236
1011010120000
11473aa20130
122173325280
13106605ba09
1476638658c
154468dcba0
hex290411940

11010120000 has 560 divisors, whose sum is σ = 41896588800. Its totient is φ = 2522880000.

The previous prime is 11010119993. The next prime is 11010120013. The reversal of 11010120000 is 2101011.

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

It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 25079781 + ... + 25080219.

Almost surely, 211010120000 is an apocalyptic number.

11010120000 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 11010120000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20948294400).

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

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

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

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

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

The product of its (nonzero) digits is 2, while the sum is 6.

Adding to 11010120000 its reverse (2101011), we get a palindrome (11012221011).

The spelling of 11010120000 in words is "eleven billion, ten million, one hundred twenty thousand".