Properties of the Number 47124

Forty-Seven Thousand One Hundred Twenty-Four

Basics

Value: 47123 → 47124 → 47125

Parity: even

Prime: No

Previous Prime: 47123

Next Prime: 47129

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 ² × 3 ² × 7 × 11 × 17

Divisors: 1, 2, 3, 4, 6, 7, 9, 11, 12, 14

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011100000010100

Octal: 134024

Duodecimal: 23330

Hexadecimal: b814

Square: 2220671376

Square Root: 217.08063018150654

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

Amicable triples: numbers such that σ(x) = σ(y) = σ(z) = x+y+z, x<y<z. We order these triples according to the common value of σ. Sequence gives·numbers. A125490

Numbers k such that the three second-degree cyclotomic polynomials x² + 1, x² - x + 1 and x² + x + 1 are simultaneously prime when evaluated at x=k. A87277

A fourth-order linear divisibility sequence related to the Pell numbers. A238537

a(n) is the maximal number of shortest knight's move paths, from origin at center of an infinite open chessboard, to square with coordinates <= n. A242514

Number of (w,x,y,z) with all terms in {1,...,n} and median<mean. A212135

a(n) = number of knight's move paths of minimal length n steps, from origin at center of an infinite open chessboard to square (0,0) for n=0; to square (2,-1) for n=1; and to square ([(3n-3)/2], [(3n-4)/2]) for n>=2. A242512

Numbers with an equal number of deficient and abundant divisors. A335543

a(n) = floor(n*(n-1)*(n-2)*(n-3)/30). A11940

Nonnegative values·of solutions (x, y) to the Diophantine equation x²+(x+833)² = y². A129010

Period of the decimal expansion of 1/F as F runs through the Fibonacci numbers greater than 1 and not divisible by 2 or 5. A175550