Search a number
-
+
101100110001000 = 233531131941310499
BaseRepresentation
bin10110111111001100110100…
…001001001011001101101000
3111020222002001111100221000120
4112333030310021023031220
5101222411011130013000
6555004425510003240
730203145654644355
oct2677146411131550
9436862044327016
10101100110001000
112a23935246a590
12b409a66346520
134454912956b66
141ad73b2b5162c
15ba4ca4c4d6a0
hex5bf33424b368

101100110001000 has 512 divisors, whose sum is σ = 355279841280000. Its totient is φ = 23713722240000.

The previous prime is 101100110000921. The next prime is 101100110001001. The reversal of 101100110001000 is 100011001101.

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 101100110001000.

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

It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 9629493751 + ... + 9629504249.

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

Almost surely, 2101100110001000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 101100110001000 its reverse (100011001101), we get a palindrome (101200121002101).

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