Properties of the Number 5004

Five Thousand Four

Basics

Value: 5003 → 5004 → 5005

Parity: even

Prime: No

Previous Prime: 5003

Next Prime: 5009

Digit Sum: 9

Digital Root: 9

Palindrome: No

Factorization: 2 ² × 3 ² × 139

Divisors: 1, 2, 3, 4, 6, 9, 12, 18, 36, 139

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1001110001100

Octal: 11614

Duodecimal: 2A90

Hexadecimal: 138c

Square: 25040016

Square Root: 70.73895673530957

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 T(n,k), 0 <= k <= n, read by rows given by: T(0,0)=1, T(n,k)=0 if k < 0 or if k > n, T(n,0) = 3·T(n-1,0) + T(n-1,1), T(n,k) = T(n-1,k-1) + T(n-1,k+1) for k >= 1. A126953

MacMahon's generalized sum of divisors function. A2127

Main diagonal of array in A163280. A164000

T(n,k)=Number of nXk 0..1 arrays with every repeated value in every row greater than or equal to, and in every column greater than, the previous repeated value. A267788

a(n) = A019565(n) - 1. A339809

Sum of the quadratic nonresidues of prime(n). A125615

Array read by descending antidiagonals: A(n,k) is the number of achiral colorings of the facets of a regular n-dimensional orthotope using up to k colors. A325007

T(n,k)=Half the number of nXk binary arrays with every element equal to exactly one or two of its horizontal and vertical neighbors. A185835

T(n,k)=Number of nXk 0..1 arrays with no 1 equal to more than two of its king-move neighbors. A282528

Sum of integers (with multiplicity) encountered on all possible paths from n to 1 when iterating with nondeterministic map k -> k- k/p, where p is any prime factor of k. A333000