Properties of the Number -22935

Twenty-Two Thousand Nine Hundred Thirty-Five

Basics

Value: -22936 → -22935 → -22934

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 5 × 11 × 139

Divisors: 1, 3, 5, 11, 15, 33, 55, 139, 165, 417

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -101100110010111

Octal: -54627

Duodecimal: -11333

Hexadecimal: -5997

Square: 526014225

Square Root: 151.44305860619693

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

Let A(0) = 1, B(0) = 0; A(n+1) = ∑_k=0..n binomial(n,k)*B(k), B(n+1) = ∑_k=0..n -binomial(n,k)*A(k); entry gives A sequence (cf. A121868). A121867

Triangle read by rows, T(n,k) = (-1)^k*{{n,k}} where {{n,k}} are the second-order Stirling set numbers, n>=0, 0<=k<=n/2. A137375

Numbers k such that φ(k) = φ(k+1). A1274

Triangle T(n,k) of associated Stirling numbers of second kind, n >= 2, 1 <= k <= floor(n/2). A8299

Triangle of Ward numbers T(n,k) read by rows. A134991

Triangle read by rows, Ward numbers T(n, k) = ∑_m=0..k (-1)^{m + k} * binomial(n + k, n + m) * Stirling2(n + m, m), for n >= 0, 0 <= k <= n. A269939

Number of ways of placing n labeled balls into 3 indistinguishable boxes with at least 2 balls in each box. A478

Triangle of Ward numbers T(n,k) (n>=0, k=0 if n=0, otherwise 0 <= k <= n-1) read by rows. A181996

Number of quadrilateral regions in an equilateral triangular "frame" of size n (see Comments in A328526 for definition). A333033

Discriminants of quintic fields with 2 complex conjugates (negated). A23684