Properties of the Number 51051

Fifty-One Thousand Fifty-One

Basics

Value: 51050 → 51051 → 51052

Parity: odd

Prime: No

Previous Prime: 51047

Next Prime: 51059

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 3 × 7 × 11 × 13 × 17

Divisors: 1, 3, 7, 11, 13, 17, 21, 33, 39, 51

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100011101101011

Octal: 143553

Duodecimal: 25663

Hexadecimal: c76b

Square: 2606204601

Square Root: 225.94468349576186

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

Coefficient triangle for certain polynomials N(2; n,x) (rising powers of x). A62991

Number of n-step mappings with 4 inputs. A5945

The product of primes <= n that are strongly prime to n. A181836

Numerators in expansion of (1-x)^-7/2. A161201

Odd numbers with exactly 5 distinct prime factors. A46391

Triangle read by rows: T(n, k) = binomial(2·n, k-1)*binomial(2·n-k-1, n-k)/n for n, k >= 1, and T(n, 0) = 0ⁿ. A94385

Borel's triangle read by rows: T(n,k) = ∑_s=k..n binomial(s,k)*C(n,s), where C(n,s) is an entry in Catalan's triangle A009766. A234950

a(n) = product of prohibited prime factors of A090252(n). A355057

a(0)=1, a(1)=1, a(n) = 11·a(n/2) for even n, and a(n) = 10·a((n-1)/2) + a((n+1)/2) for odd n >= 3. A116525

Column 1 of A277810: a(n) = A019565(A065621(n)). A277811