Properties of the Number -160020

One Hundred Sixty Thousand Twenty

Basics

Value: -160021 → -160020 → -160019

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 9

Digital Root: 9

Palindrome: No

Factorization: 2 ² × 3 ² × 5 × 7 × 127

Divisors: 1, 2, 3, 4, 5, 6, 7, 9, 10, 12

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -100111000100010100

Octal: -470424

Duodecimal: -78730

Hexadecimal: -27114

Square: 25606400400

Square Root: 400.0249992187988

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

Given n colors, sequence gives number of ways to color the vertices of a square such that no edge has the same color on both of its vertices. A91940

Sum of distinct powers of 20; i.e., numbers with digits in {0,1} base 20; i.e., write n in base 2 and read as if written in base 20. A63012

Expansion of e.g.f.: 3·exp(3·x) / (4 - exp(3·x)). A201355

a(n) = 400·n² + 20. A158601

Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 40. A31718

Composite numbers n such that n+2 is also composite and such that (sopfr(n), sopfr(n+2)) is a twin prime pair. A001414 explains notation 'sopfr(n)'. A247048

Let the binary expansion of n be [b_d, b_d-1, ..., b₃, b₂, b₁, b₀]_2, where (if n>0) b_d = 1, b_i = 0 or 1 for i<d. To get a(n) concatenate the decimal numbers 2^b_i (if b_i = 1) or 0 (if b_i = 0). A302205

a(1) = a(2) = 1; a(n+2) = a(n+1) + a(n+1)^a(n). A58522

G.f. A(x) satisfies: A(x) = 1 + x*∑_n>=0 (A(x)ⁿ - 1/A(x)ⁿ)ⁿ. A304637