Properties of the Number 5214

Five Thousand Two Hundred Fourteen

Basics

Value: 5213 → 5214 → 5215

Parity: even

Prime: No

Previous Prime: 5209

Next Prime: 5227

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 11 × 79

Divisors: 1, 2, 3, 6, 11, 22, 33, 66, 79, 158

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1010001011110

Octal: 12136

Duodecimal: 3026

Hexadecimal: 145e

Square: 27185796

Square Root: 72.20803279414278

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

Number of partitions of n such that (greatest part) - (least part) = number of parts. A237832

a(n) = A026615(2·n, n-1). A26617

a(n) = n*(n+1)*(n+2)*(n+3)*(n+4)*(2 + 4·n + n²)/840. A101097

Triangle related to the divergent series 1^m*1! - 2^m*2! + 3^m*3! - 4^m*4! + ... for m >= -1. A163940

T(n,k) = Number of (n+1) X (k+1) binary arrays with every 2 X 2 subblock diagonal sum less antidiagonal sum equal to some horizontal or vertical neighbor 2 X 2 subblock diagonal sum less antidiagonal sum. A186128

a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = 2^p+1 + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^p+1, starting with a(1) = a(2) = a(3) = 1. A49933

T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum not equal to 0 2 4 6 or 7 and every 3X3 diagonal and antidiagonal sum equal to 0 2 4 6 or 7. A252523

T(n,k)=Number of nXk 0..2 arrays with some element plus some horizontally, vertically, diagonally or antidiagonally adjacent neighbor totalling two exactly once. A268774

G.f. A(x) satisfies: A(x) = A(x³) / (1 - x)². A309677

Triangle read by rows: T(n,m) = number of solid partitions of n with shape of a plane partition of m. A380893