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

bin | 11001000010010011111011… |

… | …011111101111001000101000 |

3 | 112102212102011021211121121020 |

4 | 121002103323133233020220 |

5 | 103413020240224013000 |

6 | 1030103500335012440 |

7 | 32123120320556430 |

oct | 3102237337571050 |

9 | 472772137747536 |

10 | 110110001001000 |

11 | 320a2431004380 |

12 | 1042408066a120 |

13 | 4959436a5bb70 |

14 | 1d294d13052c0 |

15 | cae331956ba0 |

hex | 6424fb7ef228 |

110110001001000 has 2048 divisors, whose sum is σ = 475008921354240. Its totient is φ = 20493637632000.

The previous prime is 110110001000983. The next prime is 110110001001019. The reversal of 110110001001000 is 100100011011.

Adding to 110110001001000 its reverse (100100011011), we get a palindrome (110210101012011).

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 self number, because there is not a number *n* which added to its sum of digits gives 110110001001000.

It is an unprimeable number.

It is a polite number, since it can be written in 511 ways as a sum of consecutive naturals, for example, 49222171882 + ... + 49222174118.

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

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

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

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

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

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

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

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

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

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

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