Properties of the Number 28738

Twenty-Eight Thousand Seven Hundred Thirty-Eight

Basics

Value: 28737 → 28738 → 28739

Parity: even

Prime: No

Previous Prime: 28729

Next Prime: 28751

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 2 × 14369

Divisors: 1, 2, 14369, 28738

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 111000001000010

Octal: 70102

Duodecimal: 1476A

Hexadecimal: 7042

Square: 825872644

Square Root: 169.5228598154243

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

Numerators of convergents to log₂(10). A73733

Take a squarefree semiprime and take the difference between its prime factors. If this difference is a squarefree semiprime repeat the process. Sequence lists the smallest squarefree semiprime that generates other squarefree semiprimes in the first n steps of this process. A296808

Related to the minimal number of periodic orbits of periods guaranteed by Sharkovskii's theorem. A130628

Number of nX1 0..3 arrays with every element value z a city block distance of exactly z from another element value z. A209173

Least number k such that the number of iterations of h(m) = (greatest prime divisor of m) - (least prime divisor of m) that map k to 0 is n; see Comments. A233510

Numbers whose base-13 representation has exactly 5 runs. A43660

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, 1), (0, 0, 1), (0, 1, -1), (1, 0, 1)}. A150411

Take a squarefree semiprime and take the difference of its prime factors. If it is a squarefree semiprime repeat the process. Sequence lists the squarefree semiprimes that generate other squarefree semiprimes only in the first k steps of this process. Case k = 5. A296812

Take a squarefree semiprime and take the difference of its prime factors. If it is a squarefree semiprime repeat the process. Sequence lists the squarefree semiprimes that generate other squarefree semiprimes only in the first k steps of this process. Case k = 6. A296813

Take a squarefree semiprime and take the difference of its prime factors. If it is a squarefree semiprime repeat the process. Sequence lists the squarefree semiprimes that generate other squarefree semiprimes only in the first k steps of this process. Case k = 7. A296814