Properties of the Number -19243

Nineteen Thousand Two Hundred Forty-Three

Basics

Value: -19244 → -19243 → -19242

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 7 × 2749

Divisors: 1, 7, 2749, 19243

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -100101100101011

Octal: -45453

Duodecimal: -B177

Hexadecimal: -4b2b

Square: 370293049

Square Root: 138.7191407124482

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

Integers n such that the number of digits in n! is a cube. A56851

Total number of binary digits used to write all partitions of n in binary notation. A318756

a(0) = 1; a(n) = a(n-1)*(b(n)+1)/(b(n)-1), where b(n) = A385958(n) is the largest prime p such that a(n) is an integer. A385959

a(n) = a(n-1) + a(n-2) + R(a(n-3)) + R(a(n-4)) where a(1)=a(2)=a(3)=a(4)=1 and R(n) (A004086) is the reverse of n. A74864

Interprimes which are of the form s·prime, s=7. A75282

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 213", based on the 5-celled von Neumann neighborhood. A270903

A new general triangle sequence based on the Eulerian form in three parts:m=1; t0(n,k)=If[n·k == 0, 1, Sum[(-1)^j Binomial[n + 1, j](k + 1 - j)ⁿ, {j, 0, k + 1}]] t(n,k,m)=If[n == 0, 1, ( m*(n - k) + 1)*t0(n - 1 + 1, k - 1) + (m·k + 1)*t0(n - 1 + 1, k) + m·k*(n - k)*t0(n - 2 + 1, k - 1)]. A157177