Properties of the Number 4398

Four Thousand Three Hundred Ninety-Eight

Basics

Value: 4397 → 4398 → 4399

Parity: even

Prime: No

Previous Prime: 4397

Next Prime: 4409

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 733

Divisors: 1, 2, 3, 6, 733, 1466, 2199, 4398

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000100101110

Octal: 10456

Duodecimal: 2666

Hexadecimal: 112e

Square: 19342404

Square Root: 66.31741852635702

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 sum-free subsets of {1, ..., n}. A7865

Number of compositions of n with weakly increasing differences. A325546

Table (read by rows) giving the coefficients of sum formulas of n-th Lucas numbers (A000204). The k-th row (k>=1) contains T(i,k) for i=1 to k, where k=[2·n+1+(-1)^n-1]/4 and T(i,k) satisfies L(n) = ∑_i=1..k T(i,k) * n^k-i / (k-1)!. A101032

Base-9 Keith numbers. A188200

Number of partitions of n where the difference between consecutive parts is at most 4. A238864

T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00010001. A260544

T(n,k)=Number of nXk 0..1 arrays with no 1 equal to more than two of its horizontal, vertical and antidiagonal neighbors, with the exception of exactly one element. A283347

Number of fault-free tilings of a 4 X 2n rectangle with L tetrominoes. A84481

Expansion of q * (ψ(q⁵) / ψ(q))² in powers of q where ψ() is a Ramanujan θ function. A138519

Expansion of q * (ψ(-q⁵) / ψ(-q))² in powers of q where ψ() is a Ramanujan θ function. A210458