Properties of the Number 47804

Forty-Seven Thousand Eight Hundred Four

Basics

Value: 47803 → 47804 → 47805

Parity: even

Prime: No

Previous Prime: 47797

Next Prime: 47807

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 ² × 17 × 19 × 37

Divisors: 1, 2, 4, 17, 19, 34, 37, 38, 68, 74

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1011101010111100

Octal: 135274

Duodecimal: 237B8

Hexadecimal: babc

Square: 2285222416

Square Root: 218.6412586864611

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

Reversion of y - y² + y³ - y⁴. A63019

Primitive nondeficient numbers satisfying a stronger condition that compares abundancy with related numbers as detailed in the comments. A352739

Numbers n such that n | sigma₁₂(n). A55716

Primitive abundant numbers version 2 (abundant numbers all of whose proper divisors are deficient numbers) and increasing any prime factor in the prime factorization gives a non-abundant number when factored back. A335557

a(n) = n·A007504(n)/2 = n*(sum of first n primes)/2. A156778

Numbers n such that ∑_{i = 1..q} 1/d(i) is an integer where d(i) are the divisors of n for some q and n is primitive (the set {d(1), d(2), ..., d(q)} appears only once). A226853

Coefficients of the Pascal sequence minus the Eulerian numbers: q(x,n)= = (1 - x)^{n + 1}*PolyLog[ -n, x]; p(x,n) = (q(x, n)/x - (x + 1)^{n - 1})/x. A146749

Coefficients of the Pascal sequence minus the Eulerian numbers with first and last columns subtracted: f(n)=2ⁿ - 2n; q(x,n)= = (1 - x)^{n + 1}*PolyLog[ -n, x]; p(x,n) = ((q(x, n)/x - (x + 1)^{n - 1})/x - f[n] - f[n]*x^{n - 3})/x. A146750

Number of (n+1) X (4+1) 0..2 arrays with every 2 X 2 subblock diagonal maximum minus antidiagonal minimum unequal to its neighbors horizontally, vertically, diagonally and antidiagonally. A253465

Duplicate of A008691. A47804