Properties of the Number 47020

Forty-Seven Thousand Twenty

Basics

Value: 47019 → 47020 → 47021

Parity: even

Prime: No

Previous Prime: 47017

Next Prime: 47041

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 ² × 5 × 2351

Divisors: 1, 2, 4, 5, 10, 20, 2351, 4702, 9404, 11755

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011011110101100

Octal: 133654

Duodecimal: 23264

Hexadecimal: b7ac

Square: 2210880400

Square Root: 216.84095554115234

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

Expansion of q^-1/2 * k(q) * (1 - k(q)⁴) * (K(q) / (π/2))⁶ / 4 in powers of q where k(), k'(), K() are Jacobi elliptic functions. A225923

Partial sums of A069996. A153703

Related to representation as sums of squares. A2292

Triangle read by rows: T(n,k) is the coefficient A_k in the transformation of 1 + x + x² + ... + xⁿ to the polynomial A_k*(x-3k)^k for 0 <= k <= n. A248978

Number of length-4 0..n arrays with no following elements larger than the first repeated value. A267472

Triangle read by rows: T(n,m) = ∑_k=m+1..n (n-1)!/(k-1)!*binomial(2·n-k-1, n-1)*E(k,m) where E(n,m) is Euler's triangle A173018, T(0,0) = 1, n >= m >= 0. A316773

Array T read by diagonals: T(h,k)=number of paths consisting of steps from (0,0) to (h,k) such that each step has length 1 directed up or right and no step touches the line y=2x/3 unless x=0 or x=h. A47020