Properties of the Number 23486

Twenty-Three Thousand Four Hundred Eighty-Six

Basics

Value: 23485 → 23486 → 23487

Parity: even

Prime: No

Previous Prime: 23473

Next Prime: 23497

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 × 11743

Divisors: 1, 2, 11743, 23486

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 101101110111110

Octal: 55676

Duodecimal: 11712

Hexadecimal: 5bbe

Square: 551592196

Square Root: 153.2514273995515

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

Triangular array generated by its row sums: T(n,0) = 1 for n >= 0, T(n,1) = r(n-1), T(n,k) = T(n,k-1) - (-1)^k * r(n-k) for k = 2, 3, ..., n, n >= 2, r(h) = sum of the numbers in row h of T. A54090

T(n,k)=Number of length n+k+2 0..k arrays with every value 0..k appearing at least once in every consecutive k+3 elements, and new values 0..k introduced in order. A242322

Expansion of 1/(1 + x*∏_k>=1 (1 - x^k)). A331484

a(n) = (n+1)*a(n-1) + (2-n)*a(n-2). A6183

Semiprimes in A054552. A113690

a(n) = ∑_j=1..n ∑_k=1..n τ(j·k). A372674

T(n,2), array T as in A054090. A54096

a(0)=2, a(1)=3, a(n) = 3 + a(n-1) + a(n-2) for n >= 2. A171237

Number of length n+5+2 0..5 arrays with every value 0..5 appearing at least once in every consecutive 5+3 elements, and new values 0..5 introduced in order. A242320

Number of (n+2) X (2+2) 0..4 arrays with every consecutive three elements in every row and column not having exactly two distinct values, and in every diagonal and antidiagonal having exactly two distinct values, and new values 0 upwards introduced in row major order. A252805