Properties of the Number -18959

Eighteen Thousand Nine Hundred Fifty-Nine

Basics

Value: -18960 → -18959 → -18958

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 32

Digital Root: 5

Palindrome: No

Factorization: 18959

Divisors: 1, 18959

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -100101000001111

Octal: -45017

Duodecimal: -AB7B

Hexadecimal: -4a0f

Square: 359443681

Square Root: 137.69168457100088

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 symmetrical triangle of leading ones adjusted polynomial coefficients based on Hermite orthogonal polynomials: t(n,m)=CoefficientList[HermiteH[n, x], x][[m + 1]] + Reverse[CoefficientList[ HermiteH[n, x], x]][[m + 1]] - (CoefficientList[HermiteH[n, x], x][[1]] + Reverse[CoefficientList[HermiteH[n, x], x]][[1]]) + 1. A176411

Least prime in A031932 (lesser of 14-twins) whose distance to the next 14-twin is 6·n. A52356

Primes with digit sum = 32. A106768

Positions of pandigital 10-digit numbers after the decimal point in the decimal expansion of π. A280183

Smallest prime in a sequence of n consecutive primes which add to a perfect cube. A382226

Supersingular primes of the elliptic curve X₀ (11). A6962

Beginning with 3, least prime, greater than the previous term, such that the arithmetic mean of first n terms is a prime. A90918

Primes p such that 2·p+q and 2·p+r are prime, where q and r are the next two primes after p. A340225

a(n) = numerator(∑_k=1..n d(k+1)/d(k)), where d is the number of divisors function. A386925

Triangle, read by rows of 2n+1 terms, where T(n,k) = T(n,k-1) + T(n-1,k-1) for 2n>=k>0, T(n,2n-1) = T(n,2n-2) + T(n-1,n-1) and T(n,2n) = T(n,2n-1) + T(n-1,n-1) for n>0, with T(n,0) = T(n-1,n-1) for n>0 and T(0,0) = 1. A132289