Properties of the Number 50157

Fifty Thousand One Hundred Fifty-Seven

Basics

Value: 50156 → 50157 → 50158

Parity: odd

Prime: No

Previous Prime: 50153

Next Prime: 50159

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 5573

Divisors: 1, 3, 9, 5573, 16719, 50157

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100001111101101

Octal: 141755

Duodecimal: 25039

Hexadecimal: c3ed

Square: 2515724649

Square Root: 223.9575852700685

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

Number of integer partitions of n > 0 such that the least and greatest parts are not both odd (equivalently, their product is even). A391230

Number of vertices formed in a square by straight line segments when connecting the n+1 points along each edge that divide it into n equal parts to the n+1 points on the edge on the opposite side of the square. A355839

Triangle read by rows, e.g.f. exp(x·z)/((exp(x/2)+exp(x·3/2))/((exp(3·x/2)+2·cos(sqrt(3)*x/2))/3)-1). A215065

a(0) = a(1) = 1, and a(n) = a(n-1) + a( (a(n-1)-1) mod n ) for n>=2. A268176

Number of 2-Abelian equivalence classes of words of length n over an alphabet of size 3. A289658

Number of nondecreasing -n..n vectors of length 3 whose dot product with some lexicographically greater than or equal to nondecreasing -n..n vector equals 3. A226424

Sum of primes between 100·n and 100·n + 99. A276355

Number of active (ON, black) cells at stage 2ⁿ-1 of the two-dimensional cellular automaton defined by "Rule 625", based on the 5-celled von Neumann neighborhood. A273271

T(n, k) = S(2n, n, k) for 0<=k<=n and n>=0, where S(p, q, r) is the number of upright paths from (0, 0) to (p, p-q) that do not rise above the line y = x-r. A50157