Properties of the Number 28645

Twenty-Eight Thousand Six Hundred Forty-Five

Basics

Value: 28644 → 28645 → 28646

Parity: odd

Prime: No

Previous Prime: 28643

Next Prime: 28649

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 5 × 17 × 337

Divisors: 1, 5, 17, 85, 337, 1685, 5729, 28645

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110111111100101

Octal: 67745

Duodecimal: 146B1

Hexadecimal: 6fe5

Square: 820536025

Square Root: 169.24833824885843

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

Antidiagonal sums of triangular array T defined in A014430: T(j,k) = binomial(j+1, k) - 1 for 1 <= k <= j. A129696

T(n,k)=Number of nXk 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 0, 2 or 3 neighboring 1s. A297637

Composite numbers k of the form 4u+1 for which the odd part of φ(k) divides k-1. A339870

Odd composite numbers k such that A053575(k) [the odd part of φ] divides k-1. A339880

a(1) = b(1) = 0; for n > 1, b(n) = b(n-1) + n-1 + a(n-1) and a(n) = a(n-1) + n-1 + b(n). A152891

Odd 10-gonal (or decagonal) numbers. A28993

Numbers k such that 2^2k-1 == 2 (mod 2k) and such that 2^k-1 ≠ 1 (mod k). A176033

Numbers of the form p·q*r where p, q, r are distinct primes congruent to 1 mod 4 such that Legendre(p/q) = Legendre(p/r) = Legendre(q/r) = -1. A323271

Strong pseudoprimes to base 72. A20298

Strong pseudoprimes to base 84. A20310