Properties of the Number 50729

Fifty Thousand Seven Hundred Twenty-Nine

Basics

Value: 50728 → 50729 → 50730

Parity: odd

Prime: No

Previous Prime: 50723

Next Prime: 50741

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 7 × 7247

Divisors: 1, 7, 7247, 50729

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1100011000101001

Octal: 143051

Duodecimal: 25435

Hexadecimal: c629

Square: 2573431441

Square Root: 225.23099253877118

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 2nX2k 0..3 arrays with values 0..3 introduced in row major order and each element unequal to exactly two horizontal and vertical neighbors. A198209

Expansion of 1/sqrt( (1-x) * (1-5·x)³ ). A383254

a(n) = ∑_{k=0..floor(n/2)} (k+1) * binomial(k,2*(n-2·k)). A392251

Numbers k such that the decimal part of k^1/10 starts with a 'nine digits' anagram. A34285

Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k peaks at even height. A101895

Number of 2nX4 0..3 arrays with values 0..3 introduced in row major order and each element unequal to exactly two horizontal and vertical neighbors. A198206

Number of 2nX6 0..3 arrays with values 0..3 introduced in row major order and each element unequal to exactly two horizontal and vertical neighbors. A198207

Number of 4 X n 0..2 arrays with no element equal to any value at offset (0,-1) (-1,-1) or (-2,0) and new values introduced in order 0..2. A274896

T(n,k)=Number of nXk 0..2 arrays with no element equal to any value at offset (0,-1) (-1,-1) or (-2,0) and new values introduced in order 0..2. A274895

G.f. A(x) satisfies: [xⁿ] A(x)ⁿ⁺¹ = [xⁿ] (1 + x·A(x)^3·n)ⁿ⁺¹ for n >= 0. A360336