Search a number
-
+
1001101001100 = 2235247711019901
BaseRepresentation
bin11101001000101100100…
…01010000000110001100
310112201000110011002001120
432210112101100012030
5112400223324013400
62043522140440540
7132220134051534
oct16442621200614
93481013132046
101001101001100
11356623464362
1214202a849150
137353240a095
143664c7664c4
151b093248ca0
hexe91645018c

1001101001100 has 288 divisors, whose sum is σ = 3029818079232. Its totient is φ = 255024000000.

The previous prime is 1001101001093. The next prime is 1001101001101. The reversal of 1001101001100 is 11001011001.

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 not an unprimeable number, because it can be changed into a prime (1001101001101) by changing a digit.

It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 101106150 + ... + 101116050.

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

Almost surely, 21001101001100 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 1001101001100 its reverse (11001011001), we get a palindrome (1012102012101).

Subtracting from 1001101001100 its reverse (11001011001), we obtain a palindrome (990099990099).

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