Properties of the Number -14680

Fourteen Thousand Six Hundred Eighty

Basics

Value: -14681 → -14680 → -14679

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 ³ × 5 × 367

Divisors: 1, 2, 4, 5, 8, 10, 20, 40, 367, 734

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -11100101011000

Octal: -34530

Duodecimal: -85B4

Hexadecimal: -3958

Square: 215502400

Square Root: 121.16104984688768

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

Triangle T(n,k) = t(n-k, k); t(n,m) = f(m)*t(n-1,m) + f(n)*t(n,m-1), where f(x) = x + 2. A256890

Numbers k such that there is 1 prime between 100·k and 100·k + 99. A186393

Output of the linear congruential pseudo-random number generator rand() used in Microsoft's Visual C++. A96558

a(n) = ∑_{k=0..floor(n/2)} binomial(2n-2k,2k)3^k*2^n-k. A108486

a(n) = the definite integral Integral_0..1 ∏_j=1..n 4·sin²(π*j·x) dx. A133871

Expansion of e.g.f. -log(1 - x) * exp(4·x). A346396

Number of ways to write n as an ordered sum of eight positive Fibonacci numbers (with a single type of 1). A357716

Number of (w,x,y) with all terms in {0,...,n} and |w-x| + |x-y| + |y-w| >= w + x + y. A213489

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

Maximal coefficient of (1 - x)² * (1 - x²)² * (1 - x³)² * ... * (1 - xⁿ)². A369710