Search a number
-
+
11031102000 = 2432533153373
BaseRepresentation
bin10100100011000000…
…10100001000110000
31001110202222001011100
422101200110020300
5140042430231000
65022334444400
7540234551142
oct122140241060
931422861140
1011031102000
114750851226
12217a363700
13106a4c70b9
14769088c92
15448684a00
hex291814230

11031102000 has 480 divisors, whose sum is σ = 40629828096. Its totient is φ = 2785536000.

The previous prime is 11031101999. The next prime is 11031102011. The reversal of 11031102000 is 20113011.

It is a super-2 number, since 2×110311020002 (a number of 21 digits) contains 22 as substring.

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

It is an unprimeable number.

It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 29573814 + ... + 29574186.

Almost surely, 211031102000 is an apocalyptic number.

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

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

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

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

11031102000 is an evil number, because the sum of its binary digits is even.

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

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

Adding to 11031102000 its reverse (20113011), we get a palindrome (11051215011).

The spelling of 11031102000 in words is "eleven billion, thirty-one million, one hundred two thousand".