Properties of the Number 28275

Twenty-Eight Thousand Two Hundred Seventy-Five

Basics

Value: 28274 → 28275 → 28276

Parity: odd

Prime: No

Previous Prime: 28229

Next Prime: 28277

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 5 ² × 13 × 29

Divisors: 1, 3, 5, 13, 15, 25, 29, 39, 65, 75

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110111001110011

Octal: 67163

Duodecimal: 14443

Hexadecimal: 6e73

Square: 799475625

Square Root: 168.15171720800237

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

Numbers m that are the hypotenuse of exactly 22 distinct integer-sided right triangles, i.e., m² can be written as a sum of two squares in 22 ways. A97103

Array read by antidiagonals: T(n,k) is the number of binary rooted trees with n leaves of k colors and all non-leaf nodes having out-degree 2. A319539

Numbers that define integer Heronian triangles [prime(a(n)), prime(a(n)+1), A068965(n)] with area A068966(n). A68964

Number of rooted binary MUL-trees with n leaves on the label set [5]. A220818

Numbers m having greatest prime power divisor d such that d is smaller than the difference between m and the largest prime smaller than m and d is smaller than the difference between m and twice the largest prime smaller than m/2. A290290

Number of nodes in graph BC(n,2) when the internal nodes are counted with multiplicity. A343994

Elements in 4-Pascal triangle (by row). A28275

Square table defined by T(n,k) = ∑_{m=k(k+1)/2..k(k+1)/2+k} [x^m] S(x)ⁿ for n>=1, k>=0, where S(x) = ∑_n>=0 xⁿ⁽ⁿ⁺¹/2), as read by antidiagonals. A162430

a(n) is the least A for which there exists B with 0 < B < A so that (A^2ⁿ + B^2ⁿ)/2 is prime. A301738