Properties of the Number 5263

Five Thousand Two Hundred Sixty-Three

Basics

Value: 5262 → 5263 → 5264

Parity: odd

Prime: No

Previous Prime: 5261

Next Prime: 5273

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 19 × 277

Divisors: 1, 19, 277, 5263

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1010010001111

Octal: 12217

Duodecimal: 3067

Hexadecimal: 148f

Square: 27699169

Square Root: 72.54653678846427

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 2 X 2 singular integer matrices with elements from {0,...,n}. A59306

a(1) = 1; a(n) is smallest number >= a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime. A33680

a(n) = least k such that the remainder when 28^k is divided by k is n. A128368

Number of compositions of n with all adjacent parts (x, y) satisfying x > 2y or y > 2x. A342332

T(n,k)=Number of nXk 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 1 or 4 neighboring 1s. A297582

Palindromes in factorial base. A46807

T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with every 3X3 subblock having three equal elements in a row horizontally, vertically, diagonally or antidiagonally exactly three ways, and new values 0..2 introduced in row major order. A204284

Number of gap-free but not complete compositions of n. A251729

Number of inequivalent binary [ n,3 ] codes of dimension <= 3 without zero columns. A34337

T(n,k)=Number of nXk 0..1 arrays with each 1 adjacent to 0 or 2 king-move neighboring 1s. A295781