Search a number
-
+
1100010110102 = 2550005055051
BaseRepresentation
bin10000000000011101101…
…101100011110010010110
310220011022121002102011222
4100000131231203302112
5121010310042010402
62201200534130342
7142321163443031
oct20003555436226
93804277072158
101100010110102
1139456a036952
121592331b09b2
137c965c07c97
143b35297a018
151d9317eb7a2
hex1001db63c96

1100010110102 has 4 divisors (see below), whose sum is σ = 1650015165156. Its totient is φ = 550005055050.

The previous prime is 1100010110099. The next prime is 1100010110197. The reversal of 1100010110102 is 2010110100011.

It is a happy number.

It is a semiprime because it is the product of two primes.

It is a super-2 number, since 2×11000101101022 (a number of 25 digits) contains 22 as substring.

It is a self number, because there is not a number n which added to its sum of digits gives 1100010110102.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 275002527524 + ... + 275002527527.

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

Almost surely, 21100010110102 is an apocalyptic number.

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

1100010110102 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 550005055053.

The product of its (nonzero) digits is 2, while the sum is 8.

Adding to 1100010110102 its reverse (2010110100011), we get a palindrome (3110120210113).

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

Divisors: 1 2 550005055051 1100010110102