Properties of the Number 28435

Twenty-Eight Thousand Four Hundred Thirty-Five

Basics

Value: 28434 → 28435 → 28436

Parity: odd

Prime: No

Previous Prime: 28433

Next Prime: 28439

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 5 × 11 ² × 47

Divisors: 1, 5, 11, 47, 55, 121, 235, 517, 605, 2585

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110111100010011

Octal: 67423

Duodecimal: 14557

Hexadecimal: 6f13

Square: 808549225

Square Root: 168.62680688431482

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

Array read by antidiagonals: T(n,k) is the number of nonequivalent series-parallel networks with longest path of at most n edges and largest cut set of at most k edges. A391484

Riordan array (s(x),x·S(x)) where s(x) is the g.f. of the little Schroeder numbers A001003, and S(x) is the g.f. of the large Schroeder numbers A006318. A186826

Number of (s,4) gates. A37296

Number of (s,5) gates. A37297

Super-Catalan triangle (read by rows) = triangular array associated with little Schroeder numbers (read by rows): T(0,0)=1, T(p,q) = T(p,q-1) if 0 < p = q, T(p,q) = T(p,q-1) + T(p-1,q) + T(p-1,q-1) if -1 < p < q and T(p,q) = 0 otherwise. A144944

A triangle sequence of the form:q=3:t(n,m,q)=Sum[qⁱ*Floor[Eulerian[n + 1, m]/2ⁱ], {i, 0, 10}]. A174040

Number of (n+2)X(2+2) 0..3 arrays with every 3X3 subblock row and column sum equal to 0 3 5 6 or 8 and every 3X3 diagonal and antidiagonal sum not equal to 0 3 5 6 or 8. A252328

Golc sequence in base 5. Left to right concatenation of n,int(log₅(n)),int(log₅(int(log₅(n)))),... in base5. A28435