Properties of the Number -4404

Four Hundred Four

Basics

Value: -4405 → -4404 → -4403

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 2 ² × 3 × 367

Divisors: 1, 2, 3, 4, 6, 12, 367, 734, 1101, 1468

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1000100110100

Octal: -10464

Duodecimal: -2670

Hexadecimal: -1134

Square: 19395216

Square Root: 66.36264009214823

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

McKay-Thompson series of class 18e for the Monster group. A58543

McKay-Thompson series of class 18f for the Monster group. A58544

Number of partitions of n into distinct parts such that number of parts is odd. A67659

Number of partitions of n into distinct parts such that number of parts is even. A67661

Number of strict odd-length integer partitions of 2n. A344650

Number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1),U=(1,2), or d=(1,-1) and have no peaks of the form ud. A108447

Numbers whose decimal expansion contains only 0's and 4's. A169967

T(n,k)=Number of nXk 0..3 arrays with every 0 next to a 1, every 1 next to a 2 and every 2 next to a 3 horizontally, diagonally or antidiagonally, and no adjacent values equal. A232376

Number of partitions of n into distinct parts with an odd rank. A117193

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