Properties of the Number -24279

Twenty-Four Thousand Two Hundred Seventy-Nine

Basics

Value: -24280 → -24279 → -24278

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 8093

Divisors: 1, 3, 8093, 24279

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -101111011010111

Octal: -57327

Duodecimal: -12073

Hexadecimal: -5ed7

Square: 589469841

Square Root: 155.8172005909489

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) = number of steps to reach 0 when starting from k = n³ and repeatedly applying the map that replaces k with k - A055401(k), where A055401(k) = the number of positive cubes needed to sum to k using the greedy algorithm. A261227

Expansion of 1/(1 - x² - x⁷). A369813

Expansion of 1 / ((1-x)² - x⁷). A392543

a(n) = ∑_k=1..n k * τ(k)², where τ is A000005. A320896

Number of trees on n vertices with an odd number of leaves. A262431

a(n) is the least integer k such that k/Fibonacci(n) > 1/5. A293637

a(n) is the integer k that minimizes |k/Fibonacci(n) - 1/5|. A293638

Average number of binary strings of length n with Levenshtein distance <= 3 from a uniform randomly sampled binary string of this length, rounded to nearest integer. A332918

Least number of steps required in 2D prime walk for it to cross itself n times. A268463

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 387", based on the 5-celled von Neumann neighborhood. A271545