Properties of the Number -23979

Twenty-Three Thousand Nine Hundred Seventy-Nine

Basics

Value: -23980 → -23979 → -23978

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 30

Digital Root: 3

Palindrome: No

Factorization: 3 × 7993

Divisors: 1, 3, 7993, 23979

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -101110110101011

Octal: -56653

Duodecimal: -11A63

Hexadecimal: -5dab

Square: 574992441

Square Root: 154.85154180698365

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 subsets of {1..n} containing no differences or quotients of pairs of distinct elements. A326490

Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths incorporating each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 4, n >= 2. A214510

G.f. satisfies: A(x) = (1+x+x²) * A(x²)². A237651

Triangle read by rows: a(m,m) = 1, for all m. For n < m, a(m,n) = a(m-1,n) + (sum of all terms in rows 1 through m-1). A159924

a(n) = 10000·log(n) rounded to nearest integer. A4244

Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths incorporating each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 8, n >= 2. A214605

Numbers k such that both ∑_i=1..k i·prime(i) and ∑_i=1..k (k+1-i)*prime(i) are prime. A356178

a(n) = ceiling(10000·log(n)). A4245