Properties of the Number -24928

Twenty-Four Thousand Nine Hundred Twenty-Eight

Basics

Value: -24929 → -24928 → -24927

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 ⁵ × 19 × 41

Divisors: 1, 2, 4, 8, 16, 19, 32, 38, 41, 76

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -110000101100000

Octal: -60540

Duodecimal: -12514

Hexadecimal: -6160

Square: 621405184

Square Root: 157.8860348479244

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 ways writing 2ⁿ as unordered sums of 2 primes. A6307

T(n,k)=Number of triangular nXnXn 0..k arrays with all rows and diagonals having the same length having the same sum, with corners zero. A195805

Numbers which are representable as a sum of nineteen but no fewer consecutive nonnegative integers. A270303

The E₆-Eulerian numbers. A273000

Expansion of (theta₃(z)*theta₃(19z) + theta₂(z)*theta₂(19z))⁴. A28644

Number of trees in all forests of (unlabeled) rooted identity trees with n vertices. A291532

Solution of the complementary equation a(n) = 2·a(n-2) + b(n-2), where a(0) = 1, a(1) = 3, b(0) = 2, b(1) = 5, and (a(n)) and (b(n)) are increasing complementary sequences. A295067

Lesser of a pair of amicable numbers k < m such that s(k) = m and s(m) = k, where s(k) = A162296(k) - k is the sum of aliquot divisors of k that have a square factor. A357495

a(n) = min{ m : ∑_{n <= i <= m} 1/p_i > 1}, where p_i is the i-th prime = A000040(i). A92325

a(n) = ∑_k=0..n-2 A205497(n, k) * (k mod 2). A373753