Properties of the Number 13002

Thirteen Thousand Two

Basics

Value: 13001 → 13002 → 13003

Parity: even

Prime: No

Previous Prime: 13001

Next Prime: 13003

Digit Sum: 6

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 11 × 197

Divisors: 1, 2, 3, 6, 11, 22, 33, 66, 197, 394

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 11001011001010

Octal: 31312

Duodecimal: 7636

Hexadecimal: 32ca

Square: 169052004

Square Root: 114.02631275280281

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

Triangle, read by rows, where g.f.: A(x,y) = exp( ∑_n>=1 (2ⁿ + y)ⁿ * xⁿ/n ) is a power series in·and y with integer coefficients. A155810

Averages of twin prime pairs which are a sum of averages of two consecutive twin prime pairs. A160916

4-Smith numbers. A103125

Number of tilings of a 5 X n rectangle using n pentominoes of shapes W, I, L. A257866

Products of four distinct primes between twin primes. A353022

a(n) = 2·n*(6·n-1). A126964

a(n) = 36·n² + 6. A158479

Expansion of φ(x) / ψ(x²)² in powers of·where φ(), ψ() are Ramanujan θ functions. A232166

Total number of tilings of Ferrers-Young diagrams using dominoes and monominoes summed over all partitions of n. A304677

Always start on the lowest digit of a(n), then visit all digits of a(n) in increasing order. The terms of the sequence are the smallest one that force the visitor to walk n steps to complete his tour (a single step drives you from a digit to the closest one). A336611