Search a number
-
+
11170104000 = 2635311291459
BaseRepresentation
bin10100110011100101…
…00100001011000000
31001211110112002001120
422121302210023000
5140334021312000
65044222032240
7543543213606
oct123162441300
931743462046
1011170104000
114812261510
1221b8a18680
1310902450c3
1477d70d876
154559906a0
hex299ca42c0

11170104000 has 448 divisors, whose sum is σ = 41652748800. Its totient is φ = 2612736000.

The previous prime is 11170103981. The next prime is 11170104007. The reversal of 11170104000 is 40107111.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (11170104007) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 7655271 + ... + 7656729.

Almost surely, 211170104000 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 28, while the sum is 15.

The spelling of 11170104000 in words is "eleven billion, one hundred seventy million, one hundred four thousand".