Properties of the Number 23282

Twenty-Three Thousand Two Hundred Eighty-Two

Basics

Value: 23281 → 23282 → 23283

Parity: even

Prime: No

Previous Prime: 23279

Next Prime: 23291

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 × 7 × 1663

Divisors: 1, 2, 7, 14, 1663, 3326, 11641, 23282

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101101011110010

Octal: 55362

Duodecimal: 11582

Hexadecimal: 5af2

Square: 542051524

Square Root: 152.58440287263963

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

Least k such that ∑_i=1..k (prime(i) + prime(i+2) - 2·prime(i+1)) = 2n + 1. A73051

Numbers k such that the k-th maximal run of composite numbers has length different from all prior maximal runs. Sorted positions of first appearances in A176246 (or A046933 shifted). A373400

T(n,k)=number of distinct solutions to sum{i=1..k}(x(2i-1)*x(2i)) == 0 (mod n), with x() in 0..n-1. A180803

Indices of record high values in A036263. A293155

Triangle read by rows: T(n, k) = qStirling1(n, k, q) for q = 2, with 0 <= k <= n. A333142

Number of distinct solutions of sum{i=1..7}(x(2i-1)*x(2i)) = 0 (mod n), with x() in 0..n-1. A180799

Least integer k such that prime(k+1) - prime(k) = 2 and prime(k+2) - prime(k+1) = 2n, or 0 if no such k exists. A280941

a(n) = 3·a(n-2) - a(n-4), a(0)=2, a(1)=1, a(2)=3, a(3)=2. Alternates Lucas (A000032) and Fibonacci (A000045) sequences for even and odd n. A5247

Primes that remain prime through 3 iterations of function f(x) = 4x + 9. A23282