Properties of the Number 5097

Five Thousand Ninety-Seven

Basics

Value: 5096 → 5097 → 5098

Parity: odd

Prime: No

Previous Prime: 5087

Next Prime: 5099

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 1699

Divisors: 1, 3, 1699, 5097

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 1001111101001

Octal: 11751

Duodecimal: 2B49

Hexadecimal: 13e9

Square: 25979409

Square Root: 71.39327699440614

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

G.f.: ∏_k>=1 1/(1+x^k)^k. A255528

T(n,k)=Number of length n+2 0..k arrays with the sum of the maximum minus twice the median plus the minimum of adjacent triples multiplied by some arrangement of +-1 equal to zero. A251428

a(1) = 4; a(n) is smallest number >= a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime. A46254

a(1) = 3; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime. A74339

Number of partitions of n into Fibonacci parts (with 2 types of 1). A7000

Numbers k such that τ(k) + τ(k+1) + τ(k+2) = 10, where τ is the number of divisors function A000005. A350675

Triangle of polynomial coefficients related to the o.g.f.s of the RES1 polynomials. A160468

a(n) = ∑_{k=0..floor(n/2)} binomial(k,3*(n-2·k)). A392253

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

a(n) = ∑_{k=0..floor(n/3)} binomial(k,2·n-6·k). A391399