Properties of the Number 50887

Fifty Thousand Eight Hundred Eighty-Seven

Basics

Value: 50886 → 50887 → 50888

Parity: odd

Prime: No

Previous Prime: 50873

Next Prime: 50891

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 151 × 337

Divisors: 1, 151, 337, 50887

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100011011000111

Octal: 143307

Duodecimal: 25547

Hexadecimal: c6c7

Square: 2589486769

Square Root: 225.58147087028226

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

Expansion of g.f. (6 + 5·x - 20·x² - 12·x³ + 12·x⁴ + 3·x⁵)/(1 + x - 5·x² - 4·x³ + 6·x⁴ + 3·x⁵ - x⁶). A216605

A051838 gives numbers m such that the sum of first m primes divides the product of the first m primes. This sequence gives corresponding values of the sum of first m primes. A140763

Semiprimes in A007504 (the sum of first n primes). A189072

Triangle read by rows: T(n,k) is the number of ascent sequences of length n with first occurrence of the maximal value at position k-1. A218580

Let M(n) be the n X n matrix m(i,j)=min(i,j) for 1<=i,j<=n then a(n) is the trace of M(n)^-8. A114360

Lucky numbers that are the sum of the first k primes for some k. A46286

Triangular matrix T, read by rows, such that the anticommutator of T and U shifts the columns of T up 1 row: {T,U}(n,k) = T(n+1,k), where U denotes the triangular matrix defined by U(n,k) = A000108(n-k) = Catalan(n-k) for n>=k and where T(n,n) = (n+1). A116077

Number of connected dominating sets in the n-prism graph. A286985

Numbers whose base-15 representation has exactly 5 runs. A43672

a(0)=0, a(1)=1, a(n)=a(n-1)+a(n-2)+a(n-3) if a(n-1) is even, a(n)=a(n-1)+a(n-2) if a(n-1) is odd. A78513