Properties of the Number 50521

Fifty Thousand Five Hundred Twenty-One

Basics

Value: 50520 → 50521 → 50522

Parity: odd

Prime: No

Previous Prime: 50513

Next Prime: 50527

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

2730 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 up/down numbers: e.g.f. sec(x) + tan(x). Also for n >= 2, half the number of alternating permutations on n letters (A001250). A111

Euler (or secant or "Zig") numbers: e.g.f. (even powers only) sec(x) = 1/cos(x). A364

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

Triangle read by rows, T(n,k) = binomial(n,k)*A000111(n-k), 0 <= k <= n. A109449

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

Triangle of Euler-Bernoulli or Entringer numbers read by rows: T(n,k) is the number of down-up permutations of n+1 starting with k+1. A8282

Triangle T(n,k), 0 <= k <= n, read by rows, defined by T(0,0) = 1; T(0,k) = 0 if k>0 or if k<0; T(n,k) = k·T(n-1,k-1) + (k+1)*T(n-1,k+1). A104035

Number T(n,k) of permutations p of [n] such that the up-down signature of 0,p has nonnegative partial sums with a maximal value of k; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A258829

Triangle read by rows: T(n,k) is the number of permutations of [n] with exactly k increasing runs of even length. A97592