Properties of the Number 3184

Three Thousand One Hundred Eighty-Four

Basics

Value: 3183 → 3184 → 3185

Parity: even

Prime: No

Previous Prime: 3181

Next Prime: 3187

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 ⁴ × 199

Divisors: 1, 2, 4, 8, 16, 199, 398, 796, 1592, 3184

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 110001110000

Octal: 6160

Duodecimal: 1A14

Hexadecimal: c70

Square: 10137856

Square Root: 56.42694391866354

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 normal multiset partitions of weight n into sets with distinct sums. A381718

a(n) = floor(n*φ¹¹), where φ is the golden ratio, A001622. A4926

Number of partitions of n into partition numbers. A7279

T(n,k)=Number of nXk 0..2 arrays with horizontal differences mod 3 never 1, vertical differences mod 3 never -1, and rows and columns lexicographically nondecreasing. A229445

T(n,k) is the number of (n+1) X (k+1) 0..3 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 3 (constant-stress 1 X 1 tilings). A235301

BII-numbers of pairwise intersecting set-systems with empty intersection. A326912

Least number k such that there are exactly n ways to choose a multiset consisting of a binary index of each binary index of k. A367913

Sorted positions of first appearances in A367912 (number of multisets that can be obtained by choosing a binary index of each binary index). A367915

Number of unlabeled loop-graphs covering n vertices with at most n edges. A370169

a(n) = r·a(ceiling(n/2))+s·a(floor(n/2)) with a(1)=1 and (r,s)=(3,1). A268524