Properties of the Number 50561

Fifty Thousand Five Hundred Sixty-One

Basics

Value: 50560 → 50561 → 50562

Parity: odd

Prime: No

Previous Prime: 50551

Next Prime: 50581

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 7 × 31 × 233

Divisors: 1, 7, 31, 217, 233, 1631, 7223, 50561

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100010110000001

Octal: 142601

Duodecimal: 25315

Hexadecimal: c581

Square: 2556414721

Square Root: 224.8577328000974

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

Number T(n,k) of permutations p of [n] such that k is the maximum of the partial sums of the signed up-down jump sequence of 0,p; triangle T(n,k), n>=0, ceiling((sqrt(1+8·n)-1)/2)<=k<=n, read by rows. A316292

Number T(n,k) of permutations p of [n] such that k is the maximum of the partial sums of the signed up-down jump sequence of 0,p; triangle T(n,k), k>=0, k<=n<=k*(k+1)/2, read by columns. A316293

a(1) = 2; and for n > 1, a(n) = A341512(n) + A347096(n). A347097

Third row of Pascal-(1,7,1) array A081582. A81593

a(n) = 128·n² + 2528·n + 12481. A157436

a(n) = 2048·n² - 128·n + 1. A157448

a(i) is a square mod a(j), i <> j. A34903

Numerators of continued fraction convergents to sqrt(395). A41750

a(n) = 128·n² - 32·n + 1. A157331

Numbers n such that 71·2ⁿ-1 is prime. A50561