Properties of the Number 5260

Five Thousand Two Hundred Sixty

Basics

Value: 5259 → 5260 → 5261

Parity: even

Prime: No

Previous Prime: 5237

Next Prime: 5261

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 ² × 5 × 263

Divisors: 1, 2, 4, 5, 10, 20, 263, 526, 1052, 1315

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1010010001100

Octal: 12214

Duodecimal: 3064

Hexadecimal: 148c

Square: 27667600

Square Root: 72.52585745787498

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 plane partitions of n with at most two rows. A990

Start with a single triangle; at n-th generation add a triangle at each vertex, allowing triangles to overlap; sequence gives total population of triangles at n-th generation. A61777

Triangle T(n,k,p,q,j) = T(n-1,k,p,q,j) + T(n-1,k-1,p,q,j) + (p·j+q)*prime(j)*T(n-2,k-1,p,q,j) with T(2,k,p,q,j) = prime(j) and (p,q,j) = (0,1,2), read by rows. A153516

Number of multigraphs with 4 nodes and n edges. A3082

T(n,k)=Number of nXk 0..3 arrays with every element neighboring horizontally or vertically both a 0 and a 1. A204084

Nonnegative values·of solutions (x, y) to the Diophantine equation x² + (x+263)² = y². A207058

Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths incorporating each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 3, n >= 2. A214504

T(n,k) is the number of (n+1) X (k+1) 0..7 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 3 (constant-stress 1 X 1 tilings). A234233

a(n) is the index of the last occurrence of n in A316774. A316984

Number of + signs needed to write the partitions of n (A000041) as sums. A76276