Properties of the Number 61921

Sixty-One Thousand Nine Hundred Twenty-One

Basics

Value: 61920 → 61921 → 61922

Parity: odd

Prime: No

Previous Prime: 61909

Next Prime: 61927

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 19 × 3259

Divisors: 1, 19, 3259, 61921

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1111000111100001

Octal: 170741

Duodecimal: 2BA01

Hexadecimal: f1e1

Square: 3834210241

Square Root: 248.83930557691244

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

Least k such that the k-th maximal run of nonsquarefree numbers has length n. Position of first appearance of n in A053797. A373199

Triangle of numbers S(x,y) = number of lattice paths from (0,0) to (x,y) that use step set { (0,1), (1,0), (2,0), (3,0), ....} and never pass below y = x. A11117

Let S(x,y) = number of lattice paths from (0,0) to (x,y) that use the step set { (0,1), (1,0), (2,0), (3,0), ...} and never pass below y = x. Sequence gives S(n-1,n) = number of 'Schröder' trees with n+1 leaves and root of degree 2. A10683

a(n) = n⁴ * ∑_{p∣n, p prime} 1/p⁴. A351244

Triangle read by rows: T(n,k) is number of Schroeder paths of length 2n and having k peaks at height 1, for 0 <= k <= n. A104219

Numbers n such that (nⁿ-2)/(n-2) is an integer. A242787

Main diagonal of Unlucky array: a(n) = A255543(n,n). A255549

Gaps of 10 in sequence A038593 (lower terms). A38659

Triangle read by rows: T(n,k) is the number of dissections of a convex n-gon by nonintersecting diagonals, having a k-gon over a fixed edge (base). A91370

The sum of the next n terms of A114103. A114105