Properties of the Number 7005

Seven Thousand Five

Basics

Value: 7004 → 7005 → 7006

Parity: odd

Prime: No

Previous Prime: 7001

Next Prime: 7013

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 3 × 5 × 467

Divisors: 1, 3, 5, 15, 467, 1401, 2335, 7005

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1101101011101

Octal: 15535

Duodecimal: 4079

Hexadecimal: 1b5d

Square: 49070025

Square Root: 83.69587803470371

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

Let r, s, t be three permutations of the set {1,2,3,..,n}; a(n) = value of ∑_i=1..n r(i)*s(i)*t(i), with r={1,2,3,..,n}; s={n,n-1,..,1} and t={n,n-2,n-4,...,1,...,n-3,n-1}. A70893

T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000101 00010101 or 01010101. A260015

T(n,k)=Number of nXk 0..1 arrays with each 1 adjacent to 2 or 4 king-move neighboring 1s. A296039

Row 5 of A277710: Positions of 5's in A264977; positions of 10's in A277330. A277715

a(n) = 6·n² - 10·n + 5. A136392

a(n) = least m such that if r and s in {1/1, 1/4, 1/7, ..., 1/(3n-2)} satisfy r < s, then r < k/m < (k+1)/m < s for some integer k. A24836

Number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 195", based on the 5-celled von Neumann neighborhood. A270689

Row sums of A117488 which has 1, 3, 5, 7, ... entries per row. A117489

G.f. A(x,y) = ∑_n>=0 xⁿ/(1-y)^2·n+1 * ∑_k=0..3·n T(n,k)*y^k satisfies: y = ∑_n=-oo..+oo (-1)ⁿ * x^n*(n+1/2) * A(x,y)ⁿ. A355870

Number of partitions of n whose least part is a multiple of 4. A363095