Properties of the Number -20383

Twenty Thousand Three Hundred Eighty-Three

Basics

Value: -20384 → -20383 → -20382

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 11 × 17 × 109

Divisors: 1, 11, 17, 109, 187, 1199, 1853, 20383

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -100111110011111

Octal: -47637

Duodecimal: -B967

Hexadecimal: -4f9f

Square: 415466689

Square Root: 142.76904426380392

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 sin(log(1+x))*exp(x). A9457

Number of integer partitions of n with integer alternating product. A347446

Starts of runs of 3 consecutive integers that are Stolarsky-Niven numbers (A364123). A364125

a(n) = 26·n² - 1. A158551

Triangle of coefficients of polynomials u(n,x) jointly generated with A209831; see the Formula section. A209830

a(n) = 784·n - 1. A158399

a(n) = n³ - 2·n² - 1. A214731

Semiperimeter of primitive Pythagorean triangles having legs that add up to a square, sorted on hypotenuse. A89549

A new general triangle sequence based on the Eulerian form in three parts ( subtraction):m=2; 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)]. A157180