Properties of the Number 28405

Twenty-Eight Thousand Four Hundred Five

Basics

Value: 28404 → 28405 → 28406

Parity: odd

Prime: No

Previous Prime: 28403

Next Prime: 28409

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 5 × 13 × 19 × 23

Divisors: 1, 5, 13, 19, 23, 65, 95, 115, 247, 299

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 110111011110101

Octal: 67365

Duodecimal: 14531

Hexadecimal: 6ef5

Square: 806844025

Square Root: 168.53782958137322

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(0) = 1, a(1) = 2, a(2n) = A019565(a(n)), a(2n+1) = A065642(a(n)). A285332

Composite numbers m such that A309132(m) <= m. A309235

Number of non-isomorphic multiset partitions of weight n with empty intersection and no part containing all the vertices. A319775

Triangular array read by rows: T(n,k) is the number of transitive relations on {1,2,...,n} that have exactly k reflexive points, n>=0, 0<=k<=n. A245767

Number of Dyck paths of semilength n and height exactly 8. A289421

Terms of A050530 with four prime divisors. A53340

Number of binary strings of length n with no substrings equal to 0000 0010 or 0101. A164418

Triangular array read by rows. T(n,k) is the number of idempotent Boolean relation matrices on [n] with exactly k reflexive points, n >= 0, 0 <= k <= n. A360984

Smallest i such that there exists j such that i = x + y + z, j = x·y*z has exactly n solutions in positive integers x <= y <= z. A103277

Number of equivalence classes of Boolean functions of n variables under action of M(n,2). A28405