Properties of the Number -4089

Eighty-Nine

Basics

Value: -4090 → -4089 → -4088

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 29 × 47

Divisors: 1, 3, 29, 47, 87, 141, 1363, 4089

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -111111111001

Octal: -7771

Duodecimal: -2449

Hexadecimal: -ff9

Square: 16719921

Square Root: 63.94528911499267

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

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

Centered octahedral numbers (crystal ball sequence for cubic lattice). A1845

a(n) = C(n,1) + C(n,2) + C(n,3), or n*(n² + 5)/6. A4006

12-gonal (or dodecagonal) numbers: a(n) = n*(5·n-4). A51624

Number of set partitions of strict integer partitions of n that have distinct block-sums. A279375

a(0) = 0, a(1) = 1; a(n) = max { 4·a(k) + a(n-k) | 1 <= k <= n/2 }, for n > 1. A116520

Number of primes < prime(n)². A879

Number of rooted thrice-partitions of n. A301706

a(n) = 2^prime(n-1) mod prime(n)². A196202

T(n,k) = number of length-n 0..k arrays with no adjacent pair x,x+1 repeated: infinite square array read by falling antidiagonals. A269656