Properties of the Number 23841

Twenty-Three Thousand Eight Hundred Forty-One

Basics

Value: 23840 → 23841 → 23842

Parity: odd

Prime: No

Previous Prime: 23833

Next Prime: 23857

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ³ × 883

Divisors: 1, 3, 9, 27, 883, 2649, 7947, 23841

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101110100100001

Octal: 56441

Duodecimal: 11969

Hexadecimal: 5d21

Square: 568393281

Square Root: 154.40531078949326

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(5ⁿ/2ⁿ). A94969

Composites whose prime factorization in base 5 is an anagram of the number in base 5. A260049

T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having index change (+-,+-) 0,0 1,1 or 1,2. A263964

Imaginary Rabbits: imaginary part of a(0)=i; a(1)=-i; a(n) = a(n-1) + i·a(n-2), with i = sqrt(-1). A14291

Composite numbers whose prime factors contain no digits other than 3 and 8. A36317

Number of (n+1)X(4+1) arrays of permutations of 0..n·5+4 with each element having index change (+-,+-) 0,0 1,1 or 1,2. A263962

Number of (2+1)X(n+1) arrays of permutations of 0..n·3+2 with each element having index change (+-,+-) 0,0 1,1 or 1,2. A263966

Number of strings of length n in {2,3}* for which at least one of tail(2 S) > tail(S) and tail(3 S) > tail(S) holds. A217437

Sum of exponents in prime-power factorization of C(5n,n-4). A23841

Number of n-digit squares with no zero digits. A104264