Properties of the Number 23947

Twenty-Three Thousand Nine Hundred Forty-Seven

Basics

Value: 23946 → 23947 → 23948

Parity: odd

Prime: No

Previous Prime: 23929

Next Prime: 23957

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 7 × 11 × 311

Divisors: 1, 7, 11, 77, 311, 2177, 3421, 23947

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101110110001011

Octal: 56613

Duodecimal: 11A37

Hexadecimal: 5d8b

Square: 573458809

Square Root: 154.74818254183148

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

Triangle read by rows: T(n,k) is the number of even permutations of {1,2,...,n} having k descents (n >= 1, k >= 0). A145882

Numbers k such that A118255(k) is prime. A118257

Triangle T(n,k) read by rows: number of permutations in [n] with exactly k ascents that have an even number of inversions. A128612

Triangle read by rows: T(n,k) is the number of odd permutations of {1,2,...,n} having k descents. (n>=1, k>=1). A145883

E.g.f. satisfies: A(x) = (1 + sin(x·A(x))) / cos(x·A(x)). A290579

Partial sums of A084570. A84569

Triangle T(n,k) read by rows: number of permutations in [n] with exactly k ascents that have an odd number of inversions. A128613

Number of partitions satisfying (cn(2,5) = cn(3,5) and cn(0,5) <= cn(1,5) and cn(0,5) <= cn(4,5)). A36805

Square array, read by antidiagonals, used to recursively calculate the zigzag numbers A000111. A185414

a(n) = (n¹⁰ + n⁵)/2. A71236