Properties of the Number 13538

Thirteen Thousand Five Hundred Thirty-Eight

Basics

Value: 13537 → 13538 → 13539

Parity: even

Prime: No

Previous Prime: 13537

Next Prime: 13553

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 × 7 × 967

Divisors: 1, 2, 7, 14, 967, 1934, 6769, 13538

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11010011100010

Octal: 32342

Duodecimal: 7A02

Hexadecimal: 34e2

Square: 183277444

Square Root: 116.35291143757426

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

T(n,k)=Number of nXk 0..2 arrays with every 0 next to a 1 and every 1 next to a 2 horizontally or vertically, with no adjacent values equal. A232065

a(n) = ∑_k=3..n binomial(k,3) * floor(n/k). A366971

Irregular table read by rows, T(n, k) is the rank of the k-th Seidel permutation of {1,...,n}, permutations sorted in lexicographical order. A347600

Triangle read by rows: T(n,k) = (n-1-k)*abs(s(n,n+1-k)), where s(n,k) are the signed Stirling numbers of the first kind and 1 <= k <= n. A199220

Triangle read by rows: T(n,k) = number of heapable permutations of length n that contain the max element on position k (positions starting from 0). A390546

Triangular array, T(n,k) = s(n,k) + s(n,n-k), where s(n,k) are the Stirling numbers of the first kind. A154843

G.f. A(x) satisfies: A(x) = 1 + x·A(x)² - x²/A(x)². A295504

a(n) is the number of binary strings of length n which contain exactly one run of 1s of even length. A384497

Triangle read by rows: T(n,k) is the number of binary strings of length n that contain exactly k runs of 1's of even length, 0 <= k <= floor((n+1)/3). A391669

Number of nX5 0..2 arrays with every 0 next to a 1 and every 1 next to a 2 horizontally or vertically, with no adjacent values equal. A232062