Search a number
-
+
1101101001000 = 233537411131069
BaseRepresentation
bin10000000001011110101…
…110111110100100101000
310220021010121210102011120
4100001132232332210220
5121020023324013000
62201501103455240
7142360211040000
oct20013656764450
93807117712146
101101101001000
11394a7989a380
121594985b7520
137caaac19760
143b4177c7000
151d9974836a0
hex1005ebbe928

1101101001000 has 1280 divisors, whose sum is σ = 4712832633600. Its totient is φ = 211002624000.

The previous prime is 1101101000971. The next prime is 1101101001017. The reversal of 1101101001000 is 1001011011.

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

It is an unprimeable number.

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

It is a polite number, since it can be written in 319 ways as a sum of consecutive naturals, for example, 1030028466 + ... + 1030029534.

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

Almost surely, 21101101001000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 1101101001000 its reverse (1001011011), we get a palindrome (1102102012011).

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