Properties of the Number -50521

Fifty Thousand Five Hundred Twenty-One

Basics

Value: -50522 → -50521 → -50520

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 19 × 2659

Divisors: 1, 19, 2659, 50521

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1100010101011001

Octal: -142531

Duodecimal: -252A1

Hexadecimal: -c559

Square: 2552371441

Square Root: 224.76877007271273

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

Euler (or secant) numbers E(n). A122045

Nonzero coefficients of the Swiss-Knife polynomials for the computation of Euler, tangent, and Bernoulli numbers (triangle read by rows). A153641

Expansion of e.g.f. Gudermannian(x) = 2·arctan(exp(x)) - π/2. A28296

Exponential Riordan array (sech(x),x). A119879

Expansion of e.g.f. 2·exp(x)*(1-exp(x))/(1+exp(2·x)). A163747

Triangle read by rows: T(n, k) = (-2)^k*binomial(n, k)*Euler(k, 1/2). A81658

Exponential Riordan array (sech(x), tanh(x)). A60081

Numerators of generalized Bernoulli numbers associated with the zigzag numbers A000111. A185424

A(n, k) = (m·k)! [x^k] MittagLefflerE(m, x)^-n, for m = 2, n >= 0, k >= 0; square array read by descending antidiagonals. A326327

a(n) = permanent(T(n)), where T(n) is the tangent matrix defined in A346831 and n >= 1; by convention a(0) = 1. A347598