Properties of the Number 61880

Sixty-One Thousand Eight Hundred Eighty

Basics

Value: 61879 → 61880 → 61881

Parity: even

Prime: No

Previous Prime: 61879

Next Prime: 61909

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 ³ × 5 × 7 × 13 × 17

Divisors: 1, 2, 4, 5, 7, 8, 10, 13, 14, 17

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1111000110111000

Octal: 170670

Duodecimal: 2B988

Hexadecimal: f1b8

Square: 3829134400

Square Root: 248.75690945177783

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

a(n) = lcm{1,2,...,n} / swinging_factorial(n) = A003418(n) / A056040(n). A180000

T(n,k)=Number of nXk 0..2 arrays with no element equal to more than one of its horizontal and antidiagonal neighbors and with new values introduced in order 0 sequentially upwards. A280673

Triangle read by rows, where the g.f. satisfies A(x, y) = 1 + x·A(x, y)² + x·y*A(x, y)³. A104978

a(n) = 5·binomial(n, 6). A910

Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1),U=(1,2), or d=(1,-1) and have k peaks of the form Ud. A108426

a(n) = lcm{1, ..., 2n} / binomial(2n, n). A68550

Riordan's general Eulerian recursion: T(n, k) = (k+2)*T(n-1, k) + (n-k-1) * T(n-1, k-1) with T(n,1) = 1, T(n,n) = (-1)^n-1. A157013

a(n) = 1680 * (3·n)!/((2·n)!*(n+3)!). A361038

G.f. satisfies A(x) = 1 + x⁴*A(x)²*(1 + x·A(x)). A365728

a(n) = (prime(n)⁵ - prime(n))/6. A138427