Properties of the Number -905

Nine Hundred Five

Basics

Value: -906 → -905 → -904

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 5 × 181

Divisors: 1, 5, 181, 905

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -1110001001

Octal: -1611

Duodecimal: -635

Hexadecimal: -389

Square: 819025

Square Root: 30.083217912982647

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

Expansion of (1 - 2·x³ - x⁴ - 2·x⁵ - x⁶ - x⁷ - x⁸ + 2·x⁹)/(1 + x - x³ - x⁴ - x⁵ - x⁶ - x⁷ + x⁹ + x¹⁰). A143335

Expansion of ∏_k>=1 (1 - x^k * (1 + k·x)). A336978

Expansion of g.f. A(x) satisfying ∑_n>=0 xⁿ * ∏_k=0..n (x^2·k+1 + A(x)) = theta₄(x). A369684

Values of n such that L(3) and N(3) are both prime, where L(k) = (n²+n+1)*2^2·k + (2·n+1)*2^k + 1, N(k) = (n²+n+1)*2^k + n. A226923

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

Table read by rows. T(n, k) = (-1)^{n - k} * ∑_j=k..n binomial(n, j) * A354794(j, k) * j^{n - j}. A359759

Number of partitions of n into parts each of which is used a different number of times. A98859

a(n) = ∑_k=1..n k·floor(n/k); also ∑_k=1..n σ(k) where σ(n) = sum of divisors of n (A000203). A24916

Monotonic ordering of set S generated by these rules: if·and y are in S then x² + y² is in S, and 1 is in S. A192476

Odd numbers not of form p + 2^k (de Polignac numbers). A6285