Properties of the Number 51141

Fifty-One Thousand One Hundred Forty-One

Basics

Value: 51140 → 51141 → 51142

Parity: odd

Prime: No

Previous Prime: 51137

Next Prime: 51151

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 3 × 17047

Divisors: 1, 3, 17047, 51141

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100011111000101

Octal: 143705

Duodecimal: 25719

Hexadecimal: c7c5

Square: 2615401881

Square Root: 226.14375958668415

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(1) = 1, a(n) = concatenation of two closest factors of a(n-1) whose product equals a(n-1) or if a(n-1) is a prime then the concatenation of 1 and a(n-1). A62095

Number of n X n matrices over {0,1} with rows and columns summing to 3, rows and columns sorted (>) by value. A181345

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 73", based on the 5-celled von Neumann neighborhood. A270089

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (0, -1, 1), (0, 1, -1), (0, 1, 1), (1, -1, 0)}. A149379

Triangle read by rows: a(n, m) = S1(n, m)*3^n-m, where S1 are the signed Stirling numbers of first kind A008275 (n >= 1, 1 <= m <= n). A51141

a(n) = (5·n + 4)*binomial(n+7,7)/4. A56125