Properties of the Number 13201

Thirteen Thousand Two Hundred One

Basics

Value: 13200 → 13201 → 13202

Parity: odd

Prime: No

Previous Prime: 13187

Next Prime: 13217

Digit Sum: 7

Digital Root: 7

Palindrome: No

Factorization: 43 × 307

Divisors: 1, 43, 307, 13201

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 11001110010001

Octal: 31621

Duodecimal: 7781

Hexadecimal: 3391

Square: 174266401

Square Root: 114.89560478973945

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

a(n) = L(4·n+2)/3, where L=A000032 (the Lucas sequence). A49685

Array T(k,n) read by antidiagonals. G.f.: x(1-x)/(1-kx+x²), k>1. A94954

Primitive part of Fibonacci(n). A61446

Bruckman-Lucas pseudoprimes: k | (L_k - 1), where k is composite and L_k = Lucas numbers A000032. A5845

Odd Fibonacci pseudoprimes: odd composite numbers k such that either (1) k divides Fibonacci(k-1) if k == +-1 (mod 5) or (2) k divides Fibonacci(k+1) if k == +-2 (mod 5). A81264

Number of integer partitions of n such that, for all parts·of multiplicity 1, either x - 1 or x + 1 is also a part. A355393

Composite numbers k such that k divides F(k-1) where F(j) are the Fibonacci numbers. A69106

Odd composite integers m such that F(m)² == 1 (mod m), where F(m) is the m-th Fibonacci number. A337231

a(n) = (n + 3)*(n² + 6·n + 2)/6. A5286

Composite n coprime to 5 such that Fibonacci(n) == Legendre(n,5) (mod n). A49062