Logarithm of 113

What "Log of 113" Means

A logarithm answers the question "what power of the base gives this number?" In symbols, log_b(x) = y means b^y = x.

For 113 in different bases:

• ln(113) = 4.7274… means e^4.7274 = 113, where e ≈ 2.71828.
• log₁₀(113) = 2.0531… means 10^2.0531 = 113.
• log₂(113) = 6.8201… means 2^6.8201 = 113.

The choice of base affects the numeric answer but not the underlying meaning. All three are different ways of measuring how "big" 113 is on a logarithmic scale.

Common Log: log₁₀(113)

Base-10 logarithms are the most intuitive in everyday contexts because they correspond to the number of digits.

• log₁₀(100) = 2 exactly (100 has 3 digits, log = 2)
• log₁₀(113) ≈ 2.0531 (slightly larger than 100)
• log₁₀(1,000) = 3 exactly

Because 113 is just above 100, its base-10 log is just above 2. The fractional part 0.0531 reflects how far 113 is past 100 on the multiplicative scale to 1,000.

You can use the change-of-base formula or a calculator. Most scientific calculators have a dedicated log button for log₁₀; for programming, Python's math.log10(113) returns 2.0530784434834194.

Natural Log: ln(113)

The natural logarithm uses the base e ≈ 2.71828, the unique number whose own logarithm-derivative is itself. Natural logs dominate calculus, growth models, and many areas of physics and finance.

For 113:

• ln(100) ≈ 4.6052
• ln(113) ≈ 4.7274
• ln(120) ≈ 4.7875

Worked check: e^4.7274 ≈ 2.71828^4.7274. Computing this: 2.71828⁴ ≈ 54.598, and 2.71828^0.7274 ≈ 2.0697. Multiplying: 54.598 × 2.0697 ≈ 112.99 ≈ 113. The slight gap is rounding error.

Useful conversion: ln(x) and log₁₀(x) are linked by ln(x) = log₁₀(x) × ln(10), where ln(10) ≈ 2.3026. So 2.0531 × 2.3026 ≈ 4.7274. ✓

Binary Log: log₂(113)

Base-2 logs come up everywhere in computer science, information theory, and algorithm analysis. They correspond to the number of bits required to represent a value.

• 2⁶ = 64
• 2⁷ = 128
• So log₂(113) is between 6 and 7, closer to 7. Specifically, log₂(113) ≈ 6.8201.

Practical reading: 113 fits in 7 bits because ⌈log₂(113)⌉ = 7. That is consistent with the binary representation of 113, which is 1110001 — seven binary digits. See 113 in binary and hex for the bit-by-bit walkthrough.

The change-of-base formula again: log₂(113) = ln(113) / ln(2) = 4.7274 / 0.6931 ≈ 6.8201. ✓

The Change-of-Base Formula

If your calculator only has natural log or common log, you can compute the logarithm of 113 in any base with this identity:

log_b(113) = ln(113) / ln(b) = log₁₀(113) / log₁₀(b)

So for log base 5 of 113:

• log₅(113) = ln(113) / ln(5) = 4.7274 / 1.6094 ≈ 2.9374
• Verification: 5^2.9374 ≈ 113. ✓

The formula works for any base, including unusual ones. It is the same trick that connects all three logs of 113 covered above.

A Quick Estimation Without a Calculator

If you need a rough log of 113 in your head, lean on the digit-count rule for base 10:

1. 113 has 3 digits, so log₁₀(113) is between 2 and 3.
2. 113 is just above 100, so the log is just above 2.
3. The fractional part is roughly proportional to where 113 sits between 100 and 1,000 on a logarithmic scale. 113/100 = 1.13, and log₁₀(1.13) ≈ 0.053. So log₁₀(113) ≈ 2.053.

This kind of mental estimation is often accurate enough for engineering or order-of-magnitude work. If you remember just two values — log₁₀(2) ≈ 0.301 and log₁₀(3) ≈ 0.477 — you can derive the log of any small number from them.

Why ln(113), log₁₀(113), and log₂(113) Are Irrational

113 is a prime number. For any base b that is itself an integer not equal to 113, log_b(113) cannot be a rational number. If it were rational — say p/q — then b^p/q = 113, which would force 113 to be a perfect q-th power of some integer related to b. That cannot happen for prime 113 and integer base ≠ 113.

So all three of ln(113), log₁₀(113), and log₂(113) are irrational. Their decimal expansions go on forever without repeating.

Where Logarithms of 113 Show Up

• Information theory. log₂(113) ≈ 6.82 bits. Encoding one of 113 equally likely symbols needs that much information per choice — you cannot compress below this average without loss.
• Decibel-style scales. A signal that is 113 times stronger than a reference is about 20 × log₁₀(113) ≈ 20 × 2.053 ≈ 41.06 dB stronger in voltage terms.
• Compound growth. Solving "how many years to grow 13× at 5% per year" gives ln(113/100) / ln(1.05) ≈ 0.122 / 0.0488 ≈ 2.50 years past the starting 100; the underlying tool is ln.
• Algorithms. A binary search over 113 items takes ⌈log₂(113)⌉ = 7 steps in the worst case.

Common Mistakes

• Mixing up bases. "Log" without context could mean log₁₀ (math classes), ln (calculus and science), or log₂ (computer science). Always check which base your calculator or formula assumes.
• Computing log₁₀(1.13) and forgetting the +2. log₁₀(113) is log₁₀(1.13) + log₁₀(100) = 0.053 + 2 = 2.053.
• Confusing log and log⁻¹. The inverse of "log of 113" is "10 to the power of x" (or e^x, or 2^x) — not 1 ÷ log(113).
• Treating logs as linear. log(113) is not 113 × log(1) (which would be 0); logarithms are not multiplicative in that way.

Quick-Reference Card

• ln(113): 4.7274 (natural log, base e)
• log₁₀(113): 2.0531
• log₂(113): 6.8201
• log₅(113): 2.9374
• Bits to store 113: 7
• All irrational because 113 is prime.

For more on 113's mathematical properties, see Is 113 prime?, square root of 113, and cube root of 113.