Properties of the Number 49159

Forty-Nine Thousand One Hundred Fifty-Nine

Basics

Value: 49158 → 49159 → 49160

Parity: odd

Prime: No

Previous Prime: 49157

Next Prime: 49169

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 11 × 41 × 109

Divisors: 1, 11, 41, 109, 451, 1199, 4469, 49159

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100000000000111

Octal: 140007

Duodecimal: 24547

Hexadecimal: c007

Square: 2416607281

Square Root: 221.71828972820444

Classification

Fibonacci: No

Bell Number: No

Factorial Number: No

Regular Number: No

Perfect Number: No

Special

Kaprekar Constant: No

Munchausen Constant: No

Armstrong Number: No

Kaprekar Number: No

Catalan Number: No

Vampire Number: No

Taxicab Number: No

Super Prime: No

Friedman Number: No

Fermat Number: No

Cullen Number: No

OEIS Sequences

Generalized Fibonacci numbers: a(n) = a(n-1) + 9·a(n-2). A15445

a(n) = (4·n + 1)^1/2/(4·n + 1)*((1 - p)*qⁿ - (1 - q)*pⁿ), where p = (1 - (4·n + 1)^1/2)/2 and q = (1 + (4·n + 1)^1/2)/2. A171180

Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 902", based on the 5-celled von Neumann neighborhood. A290665

Expansion of 1/(1 - x/(1 - 9·x³)^2/3). A373544

T(n,k) = number of ways to place any number of 2 X 1 tiles of k distinguishable colors into an n X 1 grid; array read by descending antidiagonals, with n, k >= 1. A193376

T(n,k) = T(n-1,k) + k·T(n-2,k) for k >= 1 and n >= 3 with T(0,k) = 0 and T(1,k) = T(2,k) = 1 for all k >= 1; array T(n,k), read by descending antidiagonals, with n >= 0 and k >= 1. A172237

Recip transform of 2*(1 + x³ + x⁴ + x⁵)-1/(1-x). A49159