Properties of the Number 47844

Forty-Seven Thousand Eight Hundred Forty-Four

Basics

Value: 47843 → 47844 → 47845

Parity: even

Prime: No

Previous Prime: 47843

Next Prime: 47857

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 ² × 3 ³ × 443

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

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011101011100100

Octal: 135344

Duodecimal: 23830

Hexadecimal: bae4

Square: 2289048336

Square Root: 218.73271360269823

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

Bessel polynomial y_n(-1). A806

Number of loopless linear chord diagrams with n chords. A278990

Square array A(n,k), n >= 1, k >= 1, read by antidiagonals, where A(n,k) is the number of permutations of n copies of 1..k introduced in order 1..k with no element equal to another within a distance of 1. A322013

Sum of quadratic residues of (n-th prime == 3 mod 4). A282035

d(n,s) = number of perfect matchings on {1, 2, ..., n} with s short pairs. A79267

Triangle read by rows: T(n,k) = number of linear chord diagrams with n chords such that every chord has length at least k (1 <= k <= n). A293157

Number of permutations of n copies of 1..7 introduced in order 1..7 with no element equal to another within a distance of 1. A190927

T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no equal horizontal or antidiagonal neighbors and new values introduced sequentially from 0. A265192

Triangle T(n,k) read by rows: coefficients of polynomials P_n(t) defined in Formula section. A291843

A(n,k) = (1/k!) * ∑_i₁=1..n ∑_i₂=1..n ... ∑_{i_k=1..n} (-1)^{i₁ + i₂ + ... + i_k} * multinomial(i₁ + i₂ + ... + i_k; i₁, i₂, ..., i_k), square array A(n,k) read by antidiagonals, for n >= 0, k >= 0. A308356