Properties of the Number -24572

Twenty-Four Thousand Five Hundred Seventy-Two

Basics

Value: -24573 → -24572 → -24571

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 ² × 6143

Divisors: 1, 2, 4, 6143, 12286, 24572

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -101111111111100

Octal: -57774

Duodecimal: -12278

Hexadecimal: -5ffc

Square: 603783184

Square Root: 156.7545852598896

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) = 4 - 3·2ⁿ. A165751

a(n) is the number of times that only 2 pegs have disks on them during the optimal solution to a Towers of Hanoi problem with n disks. A347789

Binomial transform of [1, 1, 5, 1, 5, 1, 5, ...]. A131128

a(0)=0, a(1)=1, for n>1, a(n) = n<*>n, where k<*>m = k<+>k<+>...<+>k is the m-1-fold iteration of the operation <+> defined in A206853. A206960

Number of pairs (x, y) with 0 <= x, y <= n such that the distance between two points is a positive integer. A228108

a(n) is one fourth of the total number of free ends of 4 line segments expansion at n iterations (see Comments lines for definition). A238549

a(n) is the largest number t such that there exist numbers i,j,k such that, for all m <= t, there exist integers x,y,z with x·i + y·j + z·k = m and |x|+|y|+|z| <= n. A383579

Start with 1, then alternately double or add 2. A99942

Partial sums of A200675. A200678

Expansion of x*(1 - x + 4·x²) / ((1 - x)*(1 - 2·x)). A296954