Properties of the Number -26624

Twenty-Six Thousand Six Hundred Twenty-Four

Basics

Value: -26625 → -26624 → -26623

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 ¹¹ × 13

Divisors: 1, 2, 4, 8, 13, 16, 26, 32, 52, 64

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -110100000000000

Octal: -64000

Duodecimal: -134A8

Hexadecimal: -6800

Square: 708837376

Square Root: 163.1686244349691

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-8x²-24x³)/((1-2x)²*(1+2x+4x²)). A168054

a(0)=0, a(1)=1, a(n) = n·2^n-2 for n >= 2. A57711

12-almost primes (generalization of semiprimes). A69273

Main diagonal of the table of k-almost primes (A078840): a(n) = (n+1)-st integer that is an n-almost prime. A78841

T(n,k) = number of defective 3-colorings of an n X k 0..2 array connected horizontally and antidiagonally with exactly one mistake, and colors introduced in row-major 0..2 order. A229586

Numbers of the form (2ⁱ)*(13^j). A107326

Let S_k denote the sequence of numbers j such that A001222(j) - A001221(j) = k. Then a(n) is the n-th term of S_n. A261256

a(n) = 13·2ⁿ. A5029

Numbers k such that (number of prime factors of k counted with multiplicity) less (number of distinct prime factors of k) = 10. A195069

a(n) = T(n,3), array T as in A049600. A49612