Properties of the Number 47241

Forty-Seven Thousand Two Hundred Forty-One

Basics

Value: 47240 → 47241 → 47242

Parity: odd

Prime: No

Previous Prime: 47237

Next Prime: 47251

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 29 × 181

Divisors: 1, 3, 9, 29, 87, 181, 261, 543, 1629, 5249

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1011100010001001

Octal: 134211

Duodecimal: 23409

Hexadecimal: b889

Square: 2231712081

Square Root: 217.34994824015948

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) = (9/5)*(1+4*(-9)^n-1). A165749

Number of permutations of 0..floor((n·6-2)/2) on odd squares of an n X 6 array such that each row, column, diagonal and (downwards) antidiagonal of odd squares is increasing. A215866

Partial sums of A006010. A335648

Number of permutations of 0..floor((n·6-1)/2) on even squares of an n X 6 array such that each row, column, diagonal and (downwards) antidiagonal of even squares is increasing. A215784

a(0) = 1, a(1) = 9; for n >= 2 a(n) is the number of degree-n monic reducible polynomials over GF(9), i.e., a(n) = 9ⁿ - A027381(n). A58824

Numbers that are congruent to {1, 3} mod 6. A47241

T(n,k)=Number of permutations of 0..floor((n·k-1)/2) on even squares of an nXk array such that each row, column, diagonal and (downwards) antidiagonal of even squares is increasing. A215788

T(n,k) = Number of permutations of 0..floor((n·k-2)/2) on odd squares of an n X k array such that each row, column, diagonal and (downwards) antidiagonal of odd squares is increasing. A215870