Search a number
-
+
1100010110101 = 71414311111101
BaseRepresentation
bin10000000000011101101…
…101100011110010010101
310220011022121002102011221
4100000131231203302111
5121010310042010401
62201200534130341
7142321163443030
oct20003555436225
93804277072157
101100010110101
1139456a036951
121592331b09b1
137c965c07c96
143b35297a017
151d9317eb7a1
hex1001db63c95

1100010110101 has 8 divisors (see below), whose sum is σ = 1257243413504. Its totient is φ = 942799057200.

The previous prime is 1100010110099. The next prime is 1100010110197. The reversal of 1100010110101 is 1010110100011.

It is a happy number.

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

It is not a de Polignac number, because 1100010110101 - 21 = 1100010110099 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (7).

It is a Duffinian number.

It is a congruent number.

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

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

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

Almost surely, 21100010110101 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 11125251.

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

Adding to 1100010110101 its reverse (1010110100011), we get a palindrome (2110120210112).

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

Divisors: 1 7 14143 99001 11111101 77777707 157144301443 1100010110101