Properties of the Number -48620

Forty-Eight Thousand Six Hundred Twenty

Basics

Value: -48621 → -48620 → -48619

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

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

8109 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

Triangle of binomial coefficients C(-n,k). A27555

T(n, m), numerators of coefficients in a power/Fourier series expansion of the plane pendulum's exact differential time dependence. A274076

Smallest Euler characteristic of a downset on an n-dimensional cube. A214283

Square array read by ascending antidiagonals: T(n,k) = [x^k] (1 - x)^2·k * Legendre_P(n·k, (1 + x)/(1 - x)) for n, k >= 0. A364303

Expansion of g.f. A(x,y) satisfying 0 = ∑_n=-oo..+oo xⁿ * A(x,y)ⁿ * (y - x^n-1)ⁿ⁺¹, as a triangle of coefficients T(n,k) of xⁿ*y^k in A(x,y), read by rows n >= 0. A366730

Square array read by ascending antidiagonals: T(n,k) = [x^k] (1 - x)^2·k * Legendre_P(n·k-1, (1 + x)/(1 - x)) for n, k >= 0. A364513

Expansion of (1-4·x)^17/2. A20929

Expansion of (1+x)/sqrt(1+4x²). A128057

Square array read by ascending antidiagonals: T(n,k) = [x^2·k] ( (1 + x)ⁿ⁺²/(1 - x)^n-2 )^k for n, k >= 0. A364518

Square array read by ascending antidiagonals: T(n,k) = [x^3·k] ( (1 + x)ⁿ⁺³/(1 - x)^n-3 )^k for n, k >= 0. A364519