Properties of the Number 13148

Thirteen Thousand One Hundred Forty-Eight

Basics

Value: 13147 → 13148 → 13149

Parity: even

Prime: No

Previous Prime: 13147

Next Prime: 13151

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 ² × 19 × 173

Divisors: 1, 2, 4, 19, 38, 76, 173, 346, 692, 3287

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 11001101011100

Octal: 31534

Duodecimal: 7738

Hexadecimal: 335c

Square: 172869904

Square Root: 114.6647286657933

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

Concatenate n-th prime and n-th composite. A38530

Denominators of continued fraction convergents to sqrt(969). A42875

a(n) = n³ - (n+2)². A153258

Upper (1/5,1/2) midsequence of (2ⁿ) and (5·n); see Comments. A390562

a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (odd natural numbers), t = (primes). A25117

"CFK" (necklace, size, unlabeled) transform of 2,1,1,1... A32140

Expansion of g.f. A(x) = ∏_n>=1 (1 + x^n-1 + x^2·n-1) * (1 + xⁿ + x^2·n-1) * (1 - xⁿ - x^2·n). A370541

a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (odd natural numbers), t = (primes). A24603

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), (-1, 1, 1), (0, 1, 0), (1, -1, 0)}. A148295

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, 1, 0), (0, 1, 0), (1, -1, 1), (1, 0, -1)}. A148414