Properties of the Number 63121

Sixty-Three Thousand One Hundred Twenty-One

Basics

Value: 63120 → 63121 → 63122

Parity: odd

Prime: No

Previous Prime: 63113

Next Prime: 63127

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 17 × 47 × 79

Divisors: 1, 17, 47, 79, 799, 1343, 3713, 63121

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1111011010010001

Octal: 173221

Duodecimal: 30641

Hexadecimal: f691

Square: 3984260641

Square Root: 251.23893010439286

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 of nX6 -1,1 arrays such that the sum over i=1..n,j=1..6 of i·x(i,j) is zero, the sum of x(i,j) is zero, and rows are nondecreasing (number of ways to distribute 6-across galley oarsmen left-right at n fore-aft positions so that there are no turning moments on the ship). A225342

Number of 9Xn -1,1 arrays such that the sum over i=1..9,j=1..n of i·x(i,j) is zero, the sum of x(i,j) is zero, and rows are nondecreasing (number of ways to distribute n-across galley oarsmen left-right at 9 fore-aft positions so that there are no turning moments on the ship). A225349

Numbers k that can be written as the sum of a perfect square and a factorial in exactly 3 distinct ways. A359013

T(n,k) = Number of n X k {-1,1}-arrays such that the sum over i=1..n,j=1..k of i·x(i,j) is zero, the sum of x(i,j) is zero, and rows are nondecreasing (number of ways to distribute k-across galley oarsmen left-right at n fore-aft positions so that there are no turning moments on the ship). A225345

Dimension of the space of weight 2n cusp forms for Gamma₀( 53 ). A63121