Properties of the Number 13261

Thirteen Thousand Two Hundred Sixty-One

Basics

Value: 13260 → 13261 → 13262

Parity: odd

Prime: No

Previous Prime: 13259

Next Prime: 13267

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 89 × 149

Divisors: 1, 89, 149, 13261

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11001111001101

Octal: 31715

Duodecimal: 7811

Hexadecimal: 33cd

Square: 175854121

Square Root: 115.15641536623133

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

Centered 17-gonal numbers: (17·n² - 17·n + 2)/2. A69130

Number of distinct products i·j*k·l for 1 <= i <= j <= k <= l <= n. A100437

Square array A(n, k) = A048720(A065621(σ((2n-1)²)), σ((2k-1)²)), read by falling antidiagonals, (1,1), (1,2), (2,1), (1,3), (2,2), (3,1), etc. A379221

Numbers n such that 1+2n+3n² is a triangular number. A122513

Triangle read by rows: T(n,k) is the number of ballotlike paths ending at (n, k), with 0 <= k <= n. A375085

Conjectured formula for irreducible 6-fold Euler sums of weight 2n+16. A19459

Numbers k such that the continued fraction for sqrt(k) has period 79. A20418

a(n) = floor(5·prime(n)² / 4). A246010

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (0, -1, 0), (0, 0, 1), (0, 1, -1), (1, 1, 1)}. A150865

Number of nXnXn 0..6 triangular arrays with each element·equal to the number its neighbors equal to 3,0,1,1,0,1,0 for x=0,1,2,3,4,5,6. A197752