[go: up one dir, main page]

Search a number
-
+
110110102 = 255055051
BaseRepresentation
bin1101001000000…
…10010110010110
321200012011122221
412210002112112
5211142010402
614532012554
72504630464
oct644022626
9250164587
10110110102
1157177393
1230a6115a
1319a7350b
14108a3834
159a00337
hex6902596

110110102 has 4 divisors (see below), whose sum is σ = 165165156. Its totient is φ = 55055050.

The previous prime is 110110079. The next prime is 110110127. The reversal of 110110102 is 201011011.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 201011011 = 712831141.

It is a congruent number.

It is an unprimeable number.

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

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

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

Almost surely, 2110110102 is an apocalyptic number.

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

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

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

The sum of its prime factors is 55055053.

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

The square root of 110110102 is about 10493.3360758150. The cubic root of 110110102 is about 479.3017944928.

Adding to 110110102 its reverse (201011011), we get a palindrome (311121113).

Subtracting 110110102 from its reverse (201011011), we obtain a palindrome (90900909).

The spelling of 110110102 in words is "one hundred ten million, one hundred ten thousand, one hundred two".

Divisors: 1 2 55055051 110110102