Properties of the Number -14894

Fourteen Thousand Eight Hundred Ninety-Four

Basics

Value: -14895 → -14894 → -14893

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 2 × 11 × 677

Divisors: 1, 2, 11, 22, 677, 1354, 7447, 14894

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -11101000101110

Octal: -35056

Duodecimal: -8752

Hexadecimal: -3a2e

Square: 221831236

Square Root: 122.0409767250328

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 φ(-x⁹) * f(-x³)² / f(-x²)³ in powers of·where f(), φ() are Ramanujan θ functions. A298733

Revert transform of 1 - x - x³. A49140

Sum of the largest parts in the partitions of n into 8 parts. A308998

Fibonacci sequence beginning 5, 12. A22137

G.f. satisfies: A(x) = (1 + x + x²) * A(x²)⁴. A237648

Start with 209; if even, divide by 2; if odd, add the next three primes: Trajectory of 209 under iterations of A174221, the "PrimeLatz" map. A293981

a(n) is the number of solutions to x^y == y^x (mod p) where 0 < x,y <= p² - p and p is the n-th prime. A355069

Triangle read by rows: T(n,k) = the number of Dyck paths of semilength n with k UUUU's. A135305

Start with a 2 X n array of squares, join every vertex on top edge to every vertex on bottom edge; a(n) = one-half the number of cells. A355902

Number of right triangles on an (n+1) X 5 grid. A189809