Properties of the Number -1945

Nine Hundred Forty-Five

Basics

Value: -1946 → -1945 → -1944

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 5 × 389

Divisors: 1, 5, 389, 1945

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -11110011001

Octal: -3631

Duodecimal: -1161

Hexadecimal: -799

Square: 3783025

Square Root: 44.10215414239989

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 ∏_k>=0 1/(1 + x^3·k+1)^3·k+1. A285286

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

Positive integers which apparently never result in a palindrome under repeated applications of the function A056964(x) = x + (x with digits reversed). A23108

Number of partitions of n into relatively prime parts such that multiplicities of parts are also relatively prime. A100953

Number of partitions of n into 3 or more parts. A4250

a(n) = floor(n(n+2)(2n+1)/8). A2717

Values of n such that L(20) and N(20) 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. A227523

A self-generating sequence: a(1)=1, a(2)=2, a(n+1) chosen so that a(n+1)-a(n-1) is the first number not obtainable as a(j)-a(i) for 1<=i<j<=n. A1149

Number of partitions of n into at most 6 parts. A1402

Number of partitions of n in which the greatest part is 6. A26812