Properties of the Number -20299

Twenty Thousand Two Hundred Ninety-Nine

Basics

Value: -20300 → -20299 → -20298

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 53 × 383

Divisors: 1, 53, 383, 20299

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -100111101001011

Octal: -47513

Duodecimal: -B8B7

Hexadecimal: -4f4b

Square: 412049401

Square Root: 142.47455913249917

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

Number of unlabeled rooted trees with at most n nodes. A87803

T(n,k)=Number of nXk 0..2 arrays with rows and antidiagonals unimodal and columns nondecreasing. A223918

T(n,k) = number of n X k 0..2 arrays with rows, diagonals and antidiagonals unimodal and columns nondecreasing. A224262

Number of hexagonal regions in regular n-gon with all diagonals drawn. A67153

T(n,k) = Number of n X k 0..2 arrays with rows unimodal and columns nondecreasing. A224190

Number of nX1 0..3 arrays with no more than floor(nX1/2) elements unequal to at least one horizontal or vertical neighbor, with new values introduced in row major 0..3 order. A222372

a(n) = least k such that 3^k mod k = 2ⁿ. A128148

Number of 2 X n 0..2 arrays with rows and antidiagonals unimodal and columns nondecreasing. A223919

Numbers n such that there is an integer k with the property that k^τ(n) = σ(n). A225239

a(n) = Fibonacci(p) mod p², where p = prime(n). A236395