Properties of the Number 13097

Thirteen Thousand Ninety-Seven

Basics

Value: 13096 → 13097 → 13098

Parity: odd

Prime: No

Previous Prime: 13093

Next Prime: 13099

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 7 × 1871

Divisors: 1, 7, 1871, 13097

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11001100101001

Octal: 31451

Duodecimal: 76B5

Hexadecimal: 3329

Square: 171531409

Square Root: 114.44212511134175

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

Numbers n such that the Reverse and Add! trajectory of n (presumably) does not reach a palindrome and does not join the trajectory of any term m < n. A63048

T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction. A250853

Irregular triangle read by rows: T(n,k) is the number of k-partitions of {1..2n} that are invariant under a permutation consisting of n 2-cycles (1 <= k <= 2n). A293181

The maximal number of partitions of {1..2n} that are invariant under a permutation consisting of n 2-cycles, and which have the same number of nonempty parts. A2873

Numbers k such that the Reverse and Add! trajectory of k (presumably) does not reach a palindrome (with the exception of k itself) and does not join the trajectory of any term m < k. A88753

a(n) = ∑_k=0..3 binomial(6,k)*binomial(n,k). A247608

Number of achiral color patterns (set partitions) for a row or loop of length n using exactly 6 colors (sets). A304976

a(n) = 104·n + 9977. A126978

Let f(n) = exp(π*sqrt(n)); sequence gives numbers n such that f(n) - floor(f(n)) < 1/10³. A127028

a(n) = smallest non-palindromic k such that the Reverse and Add! trajectory of k is palindrome-free and joins the trajectory of A070788(n). A89494