Properties of the Number 51513

Fifty-One Thousand Five Hundred Thirteen

Basics

Value: 51512 → 51513 → 51514

Parity: odd

Prime: No

Previous Prime: 51511

Next Prime: 51517

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 7 × 11 × 223

Divisors: 1, 3, 7, 11, 21, 33, 77, 223, 231, 669

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100100100111001

Octal: 144471

Duodecimal: 25989

Hexadecimal: c939

Square: 2653589169

Square Root: 226.9647549731015

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

Place n points in general position on each side of an equilateral triangle, and join every pair of the 3·n+3 boundary points by a chord; sequence gives number of edges in the resulting planar graph. A367119

Take pairs (x,y) with ∑_{j = x..y} j = concatenation of·and y. Sort pairs on y then x. This sequence gives y of each pair. A70153

Triangle of coefficients of polynomials in ∑_k=0..n binomial(n,k) * k^r. A102573

Expansion of g/(1 + x²*g), where g = 1+x·g⁴ is the g.f. of A002293. A387639

Numbers k such that σ(σ(σ(k))) == 6*σ(k). A67065

The (1,6)-entry of the matrix Mⁿ, where M is the 6 X 6 matrix {{1, 1, 1, 1, 1, 1},{1, 0, 0, 0, 1, 0},{1, 0, 0, 1, 0, 0},{1, 0, 1, 0, 0, 0},{1, 1, 0, 0, 0, 0}, {1, 0, 0, 0, 0, 0}}. A122365

Expansion of ∏_k>=1 (1 + x^k)^ceiling(k/2). A319106

Number of permutations of 2 indistinguishable copies of 1..n with exactly 7 adjacent element pairs in decreasing order. A151629

Table read by antidiagonals: Place k points in general position on each side of a regular n-gon and join every pair of the n*(k+1) boundary points by a chord; T(n,k) (n >= 3, k >= 0) gives number of edges in the resulting planar graph. A367190

a(n) = min { 2ⁿ, floor(100/n) }. A51513