Properties of the Number -19240

Nineteen Thousand Two Hundred Forty

Basics

Value: -19241 → -19240 → -19239

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 ³ × 5 × 13 × 37

Divisors: 1, 2, 4, 5, 8, 10, 13, 20, 26, 37

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -100101100101000

Octal: -45450

Duodecimal: -B174

Hexadecimal: -4b28

Square: 370177600

Square Root: 138.70832707519762

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 + x + x²)/(1 - x² - 2·x³). A159288

Numbers whose square can be represented in exactly two ways as the sum of a positive square and a positive fourth power. A345700

Numbers k which have a factorization k = f1·f2*...*fr where the digits of {k, f1, f2, ..., fr} together give 0,1,...,9 exactly once. A370970

Irregular triangle read by rows: T(n,k) = (2^floor(n/2)+k)-th numerator coefficient of the polynomial q_n used to parametrize the canonical stribolic iterates h_n (of order 1), for n=0,1,2,... and 0 <= k <= A000045(n+1) - 2^floor(n/2). A369992

Composite numbers with properties that its digits (which may appear with multiplicity) may not appear in any of its factors (wherein the digits may also appear with multiplicity) and the combined digits of the product and the factors must have at least one of each of the ten digits. A370972

a(1) = a(2) = 1; for n>2, a(n+1) = a(n) + a(n-1) iff n is prime, otherwise a(n+1) = a(n) + 1. A113050

Numbers k such that A011772(k) > A344878(k) and A011772(k) is a divisor of A344875(k). A344595

Table read by antidiagonals: Place k equally spaced points on each side of a regular n-gon and join every pair of these n·k points by a chord; T(n,k) (n >= 3, k >= 0) gives the number of edges in the resulting planar graph. A367305

McKay-Thompson series of class 10A for Monster. A58097

Integers k such that φ(prime(k)+1) = φ(prime(k)-1). A66902