Properties of the Number -18750

Eighteen Thousand Seven Hundred Fifty

Basics

Value: -18751 → -18750 → -18749

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 5 ⁵

Divisors: 1, 2, 3, 5, 6, 10, 15, 25, 30, 50

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -100100100111110

Octal: -44476

Duodecimal: -AA26

Hexadecimal: -493e

Square: 351562500

Square Root: 136.93063937629154

Classification

Fibonacci: No

Bell Number: No

Factorial Number: No

Regular Number: Yes

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 read by rows: coefficients T(n,k) of a binomial decomposition of 1 as ∑_k=0..n T(n,k)*binomial(n,k). A244116

Generalized Pascal's triangle made using Mod[(Prime[n] - 1)/2, 4] == 2 primorial-like Stirling polynomials. A119724

a(n) = -a(n-1) - a(n-2) + a(n-3) - a(n-5). A89134

Triangle: signed version of A055134. A137370

A triangular sequence in which the Prime[n]^2·n is treated like a variable expansion: (1-Prime[n])^2·n with the base Prime[0] is defined as one (in the Goldbach tradition) to lower the coefficients: t(n,m)=(-1)^m*Prime[n]^{2·n - m}*Binomial[2·n, m]. A141024

Expansion of (1+x)/(1-5·x). A3948

A run-length describing inverse to A181819. The multiplicity of prime(k) in a(n) is the k-th smallest prime index of n, which is A112798(n,k). A304660

Hypotenuses for which there exist exactly 5 distinct Pythagorean triangles. A84649

Dispersion of A008587 (5,10,15,20,25,30,...), by antidiagonals. A191702

Triangle read by rows: terms of a binomial decomposition of 0^n-1 as Sum(k=0..n)T(n,k). A244129