Properties of the Number 5215

Five Thousand Two Hundred Fifteen

Basics

Value: 5214 → 5215 → 5216

Parity: odd

Prime: No

Previous Prime: 5209

Next Prime: 5227

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 5 × 7 × 149

Divisors: 1, 5, 7, 35, 149, 745, 1043, 5215

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 1010001011111

Octal: 12137

Duodecimal: 3027

Hexadecimal: 145f

Square: 27196225

Square Root: 72.21495689952324

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

Constant term of the reduction by x²->x+1 of the polynomial p(n,x) defined below in Comments. A192744

a(n) = n·prime(n). A33286

Values·for "records of minima" of positive distances d = A179386(n) = A154333(x) = x³ - y². A179387

T(n,k) is the number of n X n 0..k arrays with row and column sums equal. A202784

Number of simple connected graphs g on n nodes with |Aut(g)| = 48. A241465

T(n,k)=Number of nXk binary arrays with no two ones adjacent horizontally, diagonally or antidiagonally. A228683

T(n,k)=Number of (n+1)X(k+1) 0..6 arrays with every 2X2 subblock summing to 12. A183672

Palindromes in factorial base. A46807

Every suffix prime and no 0 digits in base 6 (written in base 6). A24781

a(n) = ∑_{1 <= i, j <= n} gcd(i, j, n)³. A368743