Properties of the Number -302995

Three Hundred Two Thousand Nine Hundred Ninety-Five

Basics

Value: -302996 → -302995 → -302994

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 5 × 7 × 11 × 787

Divisors: 1, 5, 7, 11, 35, 55, 77, 385, 787, 3935

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -1001001111110010011

Octal: -1117623

Duodecimal: -127417

Hexadecimal: -49f93

Square: 91805970025

Square Root: 550.4498160595568

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 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 4 indistinguishable boxes with at least 2 balls in each box. A58844

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

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

Values of |F-hat₄(n)|, a sum involving Stirling numbers of the second kind. A261686