Properties of the Number 3004

Three Thousand Four

Basics

Value: 3003 → 3004 → 3005

Parity: even

Prime: No

Previous Prime: 3001

Next Prime: 3011

Digit Sum: 7

Digital Root: 7

Palindrome: No

Factorization: 2 ² × 751

Divisors: 1, 2, 4, 751, 1502, 3004

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 101110111100

Octal: 5674

Duodecimal: 18A4

Hexadecimal: bbc

Square: 9024016

Square Root: 54.80875842417888

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

Number of permutations p of [n] satisfying i-2 <= p(i) <= i+4 for all i in [n]. A72850

a(n) = 2·n² - n + 1. A130883

Smallest palindrome greater than n in bases n and n+1. A48268

Triangle T(n, k, m) = (m*(n-k) + 1)*T(n-1, k-1, m) + (m·k + 1)*T(n-1, k, m) + m·f(n,k)*T(n-2, k-1, m) with T(n, 0, m) = T(n, n, m) = 1, f(n, k) = 2·k+1 if k <= floor(n/2) otherwise 2*(n-k)+1, and m = 1, read by rows. A157272

Expansion of 1/((1-x)⁵ - x⁵). A49016

a(n) = ∑_{k >= 0} binomial(n,5·k). A139398

a(n) = ∑_{k >= 0} binomial(n,5·k+4). A139761

Number of partitions of an n-set into blocks of size > 4. A57814

A(n,k) is the n-th positive integer that has exactly k representations of the form 1 + p1 * (1 + p2* ... * (1 + p_j)...), where [p1, ..., p_j] is a (possibly empty) list of distinct primes; square array A(n,k), n>=1, k>=0, read by antidiagonals. A317390

Numbers whose set of base 5 digits is {0,4}. A97251