Properties of the Number 13144

Thirteen Thousand One Hundred Forty-Four

Basics

Value: 13143 → 13144 → 13145

Parity: even

Prime: No

Previous Prime: 13127

Next Prime: 13147

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 ³ × 31 × 53

Divisors: 1, 2, 4, 8, 31, 53, 62, 106, 124, 212

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 11001101011000

Octal: 31530

Duodecimal: 7734

Hexadecimal: 3358

Square: 172764736

Square Root: 114.64728518373211

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 (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having directed index change -2,-2 -1,0 0,1 or 1,0. A264534

4 times 9-gonal numbers: a(n) = 2·n*(7·n-5). A152760

Number of L-shaped tiles in all tilings of a 3 X n board with 1 X 1 and L-shaped tiles (where the L-shaped tiles cover 3 squares). A127869

A trinomial transform of Fibonacci(3n). A91870

Sum of digits of square is sum of square of digits. A165550

Number of partitions p of 2n-1 such that n - (number of parts of p) is a part of p. A238641

Triangle read by rows: T(n,k) = 4·T(n-1,k-1) + T(n,k-1) with T(2·m,0) = 0 and T(2·m+1,0) = 5^m. A292466

Numbers n such that φ(2n-1) = σ(n). A67230

Array read by ascending antidiagonals. A(n, k) = k! * [x^k] log((1 - x) / (1 - 2·x)) / (1 - x)ⁿ, for 0 <= k <= n. A355257

Expansion of the e.g.f. log((1 - x) / (1 - 2·x)) / (1 - x)⁴. A355407