Properties of the Number 47873

Forty-Seven Thousand Eight Hundred Seventy-Three

Basics

Value: 47872 → 47873 → 47874

Parity: odd

Prime: No

Previous Prime: 47869

Next Prime: 47881

Digit Sum: 29

Digital Root: 2

Palindrome: No

Factorization: 7 ² × 977

Divisors: 1, 7, 49, 977, 6839, 47873

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011101100000001

Octal: 135401

Duodecimal: 23855

Hexadecimal: bb01

Square: 2291824129

Square Root: 218.79899451322896

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

Composite numbers whose prime factors have no digits other than 7's and 9's. A36324

Number of (w,x,y,z) with all terms in {0,...,n} and at least one of these conditions holds: w<R, x<R, y>R, z>R, where R = max{w,x,y,z} - min{w,x,y,z}. A212753

Composite numbers which contain their sum of aliquot parts as a substring. A225417

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 645", based on the 5-celled von Neumann neighborhood. A273316

A gap prime-type triangular sequence of coefficients: gap(n)=Prime[n+1]-Prime[n]; t(n,m)=If[n == m == 0, 1, If[m == 0, ((Prime[n] + gap[n])^ n + (Prime[n] - gap[n])ⁿ)/2, ((Prime[n] + gap[n]*Sqrt[Prime[m]])ⁿ + (Prime[n] - gap[n]*Sqrt[Prime[m]])ⁿ)/2]]. A141575

A symmetrical triangle of leading ones adjusted polynomial coefficients based on Hermite orthogonal polynomials: t(n,m)=CoefficientList[HermiteH[n, x], x][[m + 1]] + Reverse[CoefficientList[ HermiteH[n, x], x]][[m + 1]] - (CoefficientList[HermiteH[n, x], x][[1]] + Reverse[CoefficientList[HermiteH[n, x], x]][[1]]) + 1. A176411

a(n) = max_r=1..n-1 ceiling(t(t(n)-t(r-1))/(n-r+1)), where t() = triangular numbers A000217. A47873