Properties of the Number 4184

Four Thousand One Hundred Eighty-Four

Basics

Value: 4183 → 4184 → 4185

Parity: even

Prime: No

Previous Prime: 4177

Next Prime: 4201

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 ³ × 523

Divisors: 1, 2, 4, 8, 523, 1046, 2092, 4184

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1000001011000

Octal: 10130

Duodecimal: 2508

Hexadecimal: 1058

Square: 17505856

Square Root: 64.68384651518491

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 distinct values taken by 3³^...³ (with n 3's and parentheses inserted in all possible ways). A3018

Starts of runs of 3 consecutive Zeckendorf-Niven numbers (A328208). A328210

Consider the Diophantine equation x³ + y³ = z³ + 1 (1 < x < y < z) or 'Fermat near misses'. Sequence gives values of z in monotonic increasing order. A50791

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

Triangle read by rows: T(n,k) = number of edges in a "frame" of size n X k (see Comments in A331457 for definition). A332600

T(n,k)=Number of length n+k 0..3 arrays with at most one downstep in every k consecutive neighbor pairs. A258730

a(n) = Fibonacci(n) + 3. A157726

a(n) = ∑_k=0..n k! * k^k+n * Stirling1(n,k). A350721

T(n,k) = Number of (n+2) X (k+2) binary arrays avoiding patterns 000 and 101 in rows, columns and nw-to-se diagonals. A202532

Number of nX2 0..1 arrays with every element unequal to 1, 2, 3 or 4 king-move adjacent elements, with upper left element zero. A303890