Properties of the Number 23662

Twenty-Three Thousand Six Hundred Sixty-Two

Basics

Value: 23661 → 23662 → 23663

Parity: even

Prime: No

Previous Prime: 23633

Next Prime: 23663

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 × 11831

Divisors: 1, 2, 11831, 23662

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101110001101110

Octal: 56156

Duodecimal: 1183A

Hexadecimal: 5c6e

Square: 559890244

Square Root: 153.82457540978294

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

G.f. A(x) satisfies: A( A(x)³ - A(x)⁴ ) = x·A(x)². A380054

G.f. A(x) satisfies 0 = A(0) and 0 = f(x, A(x)) where f(u, v) = (v - u) * (1 + u·v) - v * (v + u). A245734

a(n+3) = a(n+2) + 3·a(n+1) + a(n). A111352

a(n) = A026568(n,n-1), also a(n) = number of integer strings s(0),...,s(n) counted by A026568 such that s(n)=1. A26570

The number of digits in max(a,b,c), where a, b, and c are the smallest positive integer solutions to a/(b+c) + b/(a+c) + c/(a+b) = A283564(n). A371846

Positions of 0 in A288478; complement of A288480. A288479

Convolution of odd numbers and primes. A23662

Number of n X 4 0,1 arrays indicating 2 X 2 subblocks of some larger (n+1) X 5 binary array having determinant equal to one. A227749