Properties of the Number -24720

Twenty-Four Thousand Seven Hundred Twenty

Basics

Value: -24721 → -24720 → -24719

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 ⁴ × 3 × 5 × 103

Divisors: 1, 2, 3, 4, 5, 6, 8, 10, 12, 15

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -110000010010000

Octal: -60220

Duodecimal: -12380

Hexadecimal: -6090

Square: 611078400

Square Root: 157.22595205626837

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

E.g.f. satisfies: A(x) = exp( x * (1 + 1/A(x))/2 ). A349719

Coefficient array of numerator polynomials of the ordinary generating functions for the alternating sums of powers for the numbers 1,2,...,2·n+1. A196848

Total sum of repeated parts in all partitions of n. A194544

Array read by antidiagonals: T(n,k) is the number of k-tuples of permutations of [n] that pairwise commute. A362827

Number of edges in the hyperoctahedral (or cocktail party) graph of order n. A368757

4·a(n) is the maximum possible determinant of a 3 X 3 matrix whose entries are 9 consecutive primes starting with prime(n). A340923

a(n) = (n!)²*∑_k=1..n 1/k!. A61573

T(n,k)=Number of length n arrays x(i), i=1..n with x(i) in i..i+k and no value appearing more than 1 time. A248944

Sequence shifts left six places under Weigh transform with a(n) = signum(n) for n<6. A316078

Solution to the Dancing School Problem with 7 girls and n+7 boys: f(7,n). A79912