Properties of the Number 23991

Twenty-Three Thousand Nine Hundred Ninety-One

Basics

Value: 23990 → 23991 → 23992

Parity: odd

Prime: No

Previous Prime: 23981

Next Prime: 23993

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 11 × 727

Divisors: 1, 3, 11, 33, 727, 2181, 7997, 23991

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101110110110111

Octal: 56667

Duodecimal: 11A73

Hexadecimal: 5db7

Square: 575568081

Square Root: 154.890283749498

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

a(n) = floor(M(g(n-1)+1, ..., g(n))), where M = harmonic mean and g(n) = n³ + n² + n + 1. A227015

Number of n-node unlabeled rooted trees with thickening limbs and root outdegree (branching factor) 4. A245144

Numbers n such that n divides the (right) concatenation of all numbers <= n written in base 23 (most significant digit on right). A29516

a(n) = floor(sqrt(Fibonacci(n+1)) - sqrt(Fibonacci(n))). A63595

Numerator of Bernoulli(n, -2/7). A158512

Partial sums of the second power of arithmetic derivative function A003415. A231864

a(n) is the number of squares strictly between Fibonacci(n) and Fibonacci(n+1). A350701

a(n) is the least positive integer k such that b(2·j) is prime for 1 <= j <= n but not prime for j = n+1, where b(1) = k and b(m+1) = b(m) + prime(m) for m >= 1. A383938

Sum of exponents of primes in multinomial coefficient M(3n; n+1,n,n-1). A23991