Search a number
-
+
110110000010001 = 3291012124069423
BaseRepresentation
bin11001000010010011111011…
…011011111101001100010001
3112102212102011012222021012120
4121002103323123331030101
5103413020240000310001
61030103500301444453
732123120306261265
oct3102237333751421
9472772135867176
10110110000010001
11320a2430497872
1210424080270729
1349594367a2a84
141d294d11280a5
15cae33180d236
hex6424fb6fd311

110110000010001 has 24 divisors (see below), whose sum is σ = 153394473056640. Its totient is φ = 70173665083200.

The previous prime is 110110000009979. The next prime is 110110000010047. The reversal of 110110000010001 is 100010000011011.

It is not a de Polignac number, because 110110000010001 - 27 = 110110000009873 is a prime.

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

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 61147225 + ... + 62922198.

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

Almost surely, 2110110000010001 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 110110000010001 its reverse (100010000011011), we get a palindrome (210120000021012).

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

Divisors: 1 3 29 87 101 303 2929 8787 10201 30603 295829 887487 124069423 372208269 3598013267 10794039801 12531011723 37593035169 363399339967 1090198019901 1265632184023 3796896552069 36703333336667 110110000010001