Base | Representation |
---|---|

bin | 10100100110010111… |

… | …00000000000000000 |

3 | 1001112201211120101000 |

4 | 22103023200000000 |

5 | 140122123400000 |

6 | 5025221012000 |

7 | 541025435412 |

oct | 122313400000 |

9 | 31481746330 |

10 | 11059200000 |

11 | 47656a2712 |

12 | 2187854000 |

13 | 1073284434 |

14 | 76cac09b2 |

15 | 44ad85000 |

hex | 2932e0000 |

11059200000 has 432 divisors, whose sum is σ = 40957222320. Its totient is φ = 2949120000.

The previous prime is 11059199999. The next prime is 11059200007. The reversal of 11059200000 is 295011.

Adding to 11059200000 its reverse (295011), we get a palindrome (11059495011).

It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.

It is a tau number, because it is divible by the number of its divisors (432).

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

It is a congruent number.

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

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2211839998 + ... + 2211840002.

It is an arithmetic number, because the mean of its divisors is an integer number (94808385).

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

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

11059200000 is a droll number since its even prime factors and its odd prime factors have the same sum.

It is an amenable number.

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

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

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

11059200000 is an frugal number, since it uses more digits than its factorization.

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

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

The product of its (nonzero) digits is 90, while the sum is 18.

The spelling of 11059200000 in words is "eleven billion, fifty-nine million, two hundred thousand".

• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.051 sec. • engine limits •