Search a number
-
+
110010120111 = 341358149631
BaseRepresentation
bin110011001110100011…
…1010011011110101111
3101111221210110010120000
41212131013103132233
53300300042320421
6122312110355343
710643103410103
oct1463507233657
9344853403500
10110010120111
1142722932541
12193a21bbb53
13a4b2631338
145478699903
152cdce46226
hex199d1d37af

110010120111 has 10 divisors (see below), whose sum is σ = 164336105472. Its totient is φ = 73340080020.

The previous prime is 110010120089. The next prime is 110010120127. The reversal of 110010120111 is 111021010011.

It is not a de Polignac number, because 110010120111 - 26 = 110010120047 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 110010120093 and 110010120102.

It is a congruent number.

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

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

It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 679074735 + ... + 679074896.

Almost surely, 2110010120111 is an apocalyptic number.

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

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

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

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

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

Adding to 110010120111 its reverse (111021010011), we get a palindrome (221031130122).

The spelling of 110010120111 in words is "one hundred ten billion, ten million, one hundred twenty thousand, one hundred eleven".

Divisors: 1 3 9 27 81 1358149631 4074448893 12223346679 36670040037 110010120111