Properties of the Number 13497

Thirteen Thousand Four Hundred Ninety-Seven

Basics

Value: 13496 → 13497 → 13498

Parity: odd

Prime: No

Previous Prime: 13487

Next Prime: 13499

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 11 × 409

Divisors: 1, 3, 11, 33, 409, 1227, 4499, 13497

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11010010111001

Octal: 32271

Duodecimal: 7989

Hexadecimal: 34b9

Square: 182169009

Square Root: 116.17658972443631

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) = (2·n - 1)*(3·n² - 3·n + 2)/2. A63491

a(n) = ∑_k=1..n (-1)^k-1 * binomial(floor(n/k)+2,3). A366395

Potential magic constants of 9 X 9 magic squares composed of consecutive primes. A191679

Sequence defined by the recurrence formula a(n+1)=sum(a(p)*a(n-p)+k,p=0..n)+l for n>=1, with here a(0)=1, a(1)=7, k=1 and l=1. A177123

Number of n X 3 0..1 arrays with every element equal to 1, 3, 4, 5, 7 or 8 king-move adjacent elements, with upper left element zero. A299583

Numbers k that are a substring of xPy where k=concatenation(x,y) and xPy is the number of permutations A008279(x,y). A359012

a(0)=0. a(n) = a(n-1) + sum of positive integers which are <= n and not part of the sequence. A129694

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

Weight distribution of [ 128,29,32 ] 2nd-order Reed-Muller code. A6006

Weight distribution of [ 64,22,16 ] 2nd-order Reed-Muller code of length 64. A1726