Properties of the Number -23854

Twenty-Three Thousand Eight Hundred Fifty-Four

Basics

Value: -23855 → -23854 → -23853

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 × 11927

Divisors: 1, 2, 11927, 23854

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -101110100101110

Octal: -56456

Duodecimal: -1197A

Hexadecimal: -5d2e

Square: 569013316

Square Root: 154.4474020500183

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(x) = 1 + x·A(x)² * A( x·A(x)² )². A120971

T(n,k) = Number of (n+1) X (k+1) 0..3 arrays with the maximum plus the upper median minus the lower median of every 2 X 2 subblock differing from its horizontal and vertical neighbors by exactly one. A238298

Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where column k is the expansion of B(x)^k, where B(x) is the g.f. of A120971. A381602

Maximum number of connections for a 2 X n rectangle. A379241

Number of (n+1)X(2+1) 0..3 arrays with the maximum plus the upper median minus the lower median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one. A238294

Number of length n+4 0..1 arrays with every five consecutive terms having the maximum of some two terms equal to the minimum of the remaining three terms. A254691

Representation degeneracies for Ramond strings. A5303

Expansion of ∏_{k > 0} (1 + f(k)*x^k), where f(k) = A147952(A004001(k)). A147982

Numbers n such that 10ⁿ - 99 is prime. A178439