Properties of the Number -2295

Two Hundred Ninety-Five

Basics

Value: -2296 → -2295 → -2294

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ³ × 5 × 17

Divisors: 1, 3, 5, 9, 15, 17, 27, 45, 51, 85

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: -100011110111

Octal: -4367

Duodecimal: -13B3

Hexadecimal: -8f7

Square: 5267025

Square Root: 47.90615826801394

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) = (n+1)*(9-9·n+5·n²-n³). A157371

Expansion of ∏_m>=1 (1 - m·q^m)⁹. A22669

Expansion of e.g.f. exp(-x) / (1 + x·exp(x)). A368272

First differences of number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 241", based on the 5-celled von Neumann neighborhood. A270991

First differences of number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 305", based on the 5-celled von Neumann neighborhood. A271163

First differences of number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 485", based on the 5-celled von Neumann neighborhood. A272505

Inverse modulo 2 binomial transform of (-2)ⁿ. A100744

T(n, k) = [x^k] 2ⁿ*(Euler(n, x) - Euler(n, x/2)), where Euler(n, x) are the Euler polynomials. Triangle read by rows, T(n, k) for 0 <= k <= n. A342315

Triangular array: the fusion of (x+1)ⁿ and (x+2)ⁿ; see Comments for the definition of fusion. A193722

Number of strict integer partitions of n with integer median. A359907