Properties of the Number -12088

Twelve Thousand Eighty-Eight

Basics

Value: -12089 → -12088 → -12087

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 ³ × 1511

Divisors: 1, 2, 4, 8, 1511, 3022, 6044, 12088

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -10111100111000

Octal: -27470

Duodecimal: -6BB4

Hexadecimal: -2f38

Square: 146119744

Square Root: 109.94544101507802

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) = A289671(n)/2^f(n), where f(n) = 2·floor((n-1)/3) + ((n+2) mod 3) = A004523(n). A289677

The smallest magic constant of an n X n magic square with distinct prime entries. A164843

Generalized Fibonacci numbers A_n,2. A6207

E.g.f.: exp(3x)/(1-3x)^1/3. A94822

Numbers that are the sum of five third powers in exactly ten ways. A345188

a(n) is the number of edges formed in a square by dividing each of its sides into n equal parts giving a total of 4·n nodes and drawing straight line segments from node k to node (k+n+1) mod 4·n, 0 <= k < 4·n. A335351

Sieve performed by successive iterations of steps where step m is: keep m terms, remove the next 2 and repeat; as m = 1,2,3,.. the remaining terms form this sequence. A112560

a(n) = Fibonacci(n) mod n³. A132636

Sequence by greedy construction satisfying Lucier-Sárközy difference set condition. A174911

The sums of pairs of adjacent terms are the odd palindromic primes in ascending order. A181882