Properties of the Number -23353

Twenty-Three Thousand Three Hundred Fifty-Three

Basics

Value: -23354 → -23353 → -23352

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 11 ² × 193

Divisors: 1, 11, 121, 193, 2123, 23353

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -101101100111001

Octal: -55471

Duodecimal: -11621

Hexadecimal: -5b39

Square: 545362609

Square Root: 152.81688388394784

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) = least k such that the remainder when 17^k is divided by k is n. A128157

Number of domino tilings of a 7-pillow of order n. A112839

Triangle of coefficients of polynomials u(n,x) jointly generated with A210861; see the Formula section of A210861. A210860

a(n) = ∑_k=1..n k² * floor(n/k)³. A350124

Smallest k > 0 such that (5ⁿ+k)*5ⁿ-1 and (5ⁿ+k)*5ⁿ+1 are a twin prime pair. A212487

Positive integers that have exactly ten representations of the form 1 + p1 * (1 + p2* ... * (1 + p_j)...), where [p1, ..., p_j] is a (possibly empty) list of distinct primes. A317400

[ n(n-1)(n-2)(n-3)/13 ]. A11923

a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = (natural numbers >= 2), t = (Fibonacci numbers). A24309

Number of n X 2 binary arrays whose sum with another n X 2 binary array containing no more than a single 1 has rows and columns in lexicographically nondecreasing order. A225894

Volume of torus (rounded down) with major radius = n and minor radius = n/3. A228641