Properties of the Number 48620

Forty-Eight Thousand Six Hundred Twenty

Basics

Value: 48619 → 48620 → 48621

Parity: even

Prime: No

Previous Prime: 48619

Next Prime: 48623

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 ² × 5 × 11 × 13 × 17

Divisors: 1, 2, 4, 5, 10, 11, 13, 17, 20, 22

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011110111101100

Octal: 136754

Duodecimal: 24178

Hexadecimal: bdec

Square: 2363904400

Square Root: 220.49943310584723

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

Central binomial coefficients: binomial(2·n,n) = (2·n)!/(n!)². A984

a(n) = binomial(n, floor(n/2)). A1405

Swinging factorial, a(n) = 2^{n-(n mod 2})*∏_k=1..n k^(-1^(k+1)). A56040

a(n) = ∑_{k = 0..n} binomial(n,floor(k/2))*(-1)^n-k. A126869

T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows. A63007

Array T(i,j) = binomial(-1/2-i,j)*(-4)^j, i,j >= 0 read by antidiagonals going down. A46521

Number of n-step walks on a line starting from the origin but not returning to it. A63886

a(n) = binomial coefficient C(n,9). A582

Triangle read by rows: T(n,k) = C(2·n - k,n), 0 <= k <= n. A92392

Triangle read by rows. T(n, k) = binomial(n+k-1, k) for 0 <= k <= n. A59481