Properties of the Number 28652

Twenty-Eight Thousand Six Hundred Fifty-Two

Basics

Value: 28651 → 28652 → 28653

Parity: even

Prime: No

Previous Prime: 28649

Next Prime: 28657

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 ² × 13 × 19 × 29

Divisors: 1, 2, 4, 13, 19, 26, 29, 38, 52, 58

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110111111101100

Octal: 67754

Duodecimal: 146B8

Hexadecimal: 6fec

Square: 820937104

Square Root: 169.26901665691804

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(n) = Fibonacci(n) - 5. A167616

Number of subsets A of {1,2,...,n} with |A+A| = |A-A|. A118544

Number of 2n X 3 0..2 arrays with values 0..2 introduced in row major order, the number of instances of each value within one of each other, and every element equal to exactly one horizontal or vertical neighbor. A199259

Draw a square and follow these steps: Take a square and place at its edges isosceles right triangles with the edge as hypotenuse. Draw a square at every new edge of the triangles. Repeat for all the new squares of the same size. New figures are only placed on empty space. The structure is symmetric about the first square. The sequence gives the numbers of squares of equal size in successive rings around the center. A265207

Number of nX4 0..1 arrays with no element unequal to a strict majority of its horizontal, diagonal and antidiagonal neighbors and with new values introduced in order 0 sequentially upwards. A281711

Triangle of scaled 1-tiered binomial coefficients, T(n,k) = 2ⁿ⁺¹*(n-k,k)_1 (n >= 0, 0 <= k <= n), where (N,M)_1 is the 1-tiered binomial coefficient. A308737

Number of partitions of positive integer n such that all parts are less than the square root of n. A316353

a(n) = A027113(n, 2n-6). A27124

Number of winning positions for the next player (a, b, c) where 1 <= a, b, c <= n in "Divisor Nim" (see comments). A383226

T(n,k)=Number of nXk 0..1 arrays with no element unequal to a strict majority of its horizontal, diagonal and antidiagonal neighbors and with new values introduced in order 0 sequentially upwards. A281715