Properties of the Number 47061

Forty-Seven Thousand Sixty-One

Basics

Value: 47060 → 47061 → 47062

Parity: odd

Prime: No

Previous Prime: 47059

Next Prime: 47087

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ⁴ × 7 × 83

Divisors: 1, 3, 7, 9, 21, 27, 63, 81, 83, 189

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011011111010101

Octal: 133725

Duodecimal: 23299

Hexadecimal: b7d5

Square: 2214737721

Square Root: 216.9354742774911

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

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction. A250898

Triangle read by rows: T(n,k) (n >= 2, k >= 1) is the number of non-crossing connected graphs on n nodes on a circle such that the distance from a fixed node (root) to the next node is k. Rows are indexed 2,3,4,...; columns are indexed 1,2,3, ... . A143018

Jacobsthal sequence A001045 convolved with A139251 (first differences of toothpick numbers). A160704

Number of length 6+3 0..n arrays with some disjoint pairs in every consecutive four terms having the same sum. A247538

Number of (n+1) X (2+1) 0..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction. A250892

Number of (6+1) X (n+1) 0..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction. A250904

a(n) = n for n = 0..3; for n>3, a(n) = 4·a(n-1) + 3·a(n-2) + 2·a(n-3) + a(n-4). A258089

Number of permutations of [n] avoiding {1324, 2143, 3421}. A294700

Number of permutations of length n which avoid the patterns 1234, 2143, 3421. A116842

T(n,k)=Number of length n+3 0..k arrays with some disjoint pairs in every consecutive four terms having the same sum. A247533