Search a number
-
+
1100110101001 = 29112333779903
BaseRepresentation
bin10000000000100011101…
…010111111101000001001
310220011120120020110220121
4100000203222333220021
5121011011141213001
62201214505223241
7142323516366502
oct20004352775011
93804516213817
101100110101001
1139461052155a
12159260791b21
137c9808475b2
143b361d67ba9
151d93a49d6a1
hex10023abfa09

1100110101001 has 8 divisors (see below), whose sum is σ = 1139058362880. Its totient is φ = 1061229401232.

The previous prime is 1100110100983. The next prime is 1100110101047. The reversal of 1100110101001 is 1001010110011.

It is a happy number.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 1100110101001 - 29 = 1100110100489 is a prime.

It is a Duffinian number.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16857385 + ... + 16922518.

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

Almost surely, 21100110101001 is an apocalyptic number.

It is an amenable number.

1100110101001 is a deficient number, since it is larger than the sum of its proper divisors (38948261879).

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

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

The sum of its prime factors is 33781055.

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

Adding to 1100110101001 its reverse (1001010110011), we get a palindrome (2101120211012).

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

Divisors: 1 29 1123 32567 33779903 979617187 37934831069 1100110101001