Properties of the Number 23623

Twenty-Three Thousand Six Hundred Twenty-Three

Basics

Value: 23622 → 23623 → 23624

Parity: odd

Prime: Yes

Previous Prime: 23609

Next Prime: 23627

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 23623

Divisors: 1, 23623

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101110001000111

Octal: 56107

Duodecimal: 11807

Hexadecimal: 5c47

Square: 558046129

Square Root: 153.69775535120868

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

Primes at which the difference pattern X424Y (X and Y >= 6) occurs in A001223. A52166

Primes having only {2, 3, 6} as digits. A260126

Primes of the form XYX, where Y is a single digit. A154270

Square array read by ascending antidiagonals: T(n,k) = [x^k] 1/(1 + x) * Legendre_P(k, (1 - x)/(1 + x))^-n for n >= 1, k >= 0. A364298

a(n) is least prime p such that 7 is the n-th term in the Euclid-Mullin sequence starting at p, or 0 if no such prime p exists. A94153

Lexicographically least sequence of primes (including 1) that are sum-free. A225947

Primes of the form abcabc..abcab. A228627

a(n) = [xⁿ] 1/(1 + x) * Legendre_P(n, (1 - x)/(1 + x))^-n-1 for n >= 0. A364302

Let p_3,1(m) be the m-th prime == 1(mod 3). Then a(n) is the smallest p_3,1(m) such that the interval(p_3,1(m)*n, p_3,1(m+1)*n) contains exactly one prime == 1(mod 3). A210465

Smallest prime > 2n+1 beginning and ending with 2n+1, or 0 if no such prime exists. A70278