Properties of the Number -20159

Twenty Thousand One Hundred Fifty-Nine

Basics

Value: -20160 → -20159 → -20158

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 19 × 1061

Divisors: 1, 19, 1061, 20159

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -100111010111111

Octal: -47277

Duodecimal: -B7BB

Hexadecimal: -4ebf

Square: 406385281

Square Root: 141.98239327465924

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

a(n) = n!/2 - 1. A139172

Smallest number requiring n terms to be expressed as a sum of factorials. A200748

a(n) = 4·n! - 1. A173321

a(n)= numerator of ((n + 3)! - (n - 3)!)/(n!). A127227

a(n) is the number of numbers removed in each step of Eratosthenes's sieve for 8!. A145535

a(1)=1. a(n) = the smallest integer > a(n-1) such that d(a(n))+d(a(n)+1) > d(a(n-1))+d(a(n-1)+1), where d(m) = the number of divisors of m. A175143

Sequence defined by a(1)=a(2)=1 and a(n) = gray(a(n-1)) + gray(a(n-2)), with gray(m) = A003188(m). A265387

Numbers k such that k and k+1 are both divisible by the total binary weight of their divisors (A093653). A338514

Least m which can be written as i·j+i+j in n different ways: A072670(m)=n. A72671

Prime(n)*prime(2·n)+prime(n)+prime(2·n). A72672