Properties of the Number 47915

Forty-Seven Thousand Nine Hundred Fifteen

Basics

Value: 47914 → 47915 → 47916

Parity: odd

Prime: No

Previous Prime: 47911

Next Prime: 47917

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 5 × 7 × 37 ²

Divisors: 1, 5, 7, 35, 37, 185, 259, 1295, 1369, 6845

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011101100101011

Octal: 135453

Duodecimal: 2388B

Hexadecimal: bb2b

Square: 2295847225

Square Root: 218.8949519746858

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

a(n) = n + (n+1)² + (n+2)³. A27620

Numbers k such that k and k+1 are both divisible by the square of their largest prime factor. A354558

Numbers k such that P(k)² | k and P(k+1)³ | (k+1), where P(k) = A006530(k) is the largest prime dividing k. A354563

Expansion of (1 - x + x²)/(1 - x - x⁴). A103632

Row sums of a triangle related to the Fibonacci polynomials. A109222

Value of A076042 at its n-th low point. A324791

Place two n-gons with radii 1 and 2 concentrically, forming an annular area between them. Connect all the vertices with line segments that lie entirely within that area. Then a(n) is the number of regions in that figure. A337700

Losing initial positions in game: two players alternate in removing >= 1 stones; last player wins; first player may not remove all stones; each move <= 3 times previous move. A3411

Gaps of 6 in sequence A038593 (upper terms). A38652

a(n) = n*(n+2)². A152619