Properties of the Number -24959

Twenty-Four Thousand Nine Hundred Fifty-Nine

Basics

Value: -24960 → -24959 → -24958

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 29

Digital Root: 2

Palindrome: No

Factorization: 11 × 2269

Divisors: 1, 11, 2269, 24959

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8109 Try Today's Challenge

Representations

Binary: -110000101111111

Octal: -60577

Duodecimal: -1253B

Hexadecimal: -617f

Square: 622951681

Square Root: 157.9841764228304

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 10's in all partitions of n. A24794

Number of partitions of n with rank 4 or higher (the rank of a partition is the largest part minus the number of parts). A363231

a(n) = numerator(∑_k=1..n d(k+1)/d(k)), where d is the number of divisors function. A386925

Minimal number of moves for the cyclic variant of the Towers of Hanoi for 3 pegs and n disks, with the final peg two steps away. A5666

Number of (n+2)X(1+2) 0..3 arrays with every 3X3 subblock row and column sum not equal to 0 2 5 6 or 7 and every 3X3 diagonal and antidiagonal sum equal to 0 2 5 6 or 7. A252416

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, -1, 1), (0, 1, -1), (1, 0, 1), (1, 1, -1)}. A148961

Triangle read by rows in which T(n,k) is the number of permutations avoiding 132 of length n with an independent set of size k in its coregraph. A262370