Properties of the Number -25832

Twenty-Five Thousand Eight Hundred Thirty-Two

Basics

Value: -25833 → -25832 → -25831

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 ³ × 3229

Divisors: 1, 2, 4, 8, 3229, 6458, 12916, 25832

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -110010011101000

Octal: -62350

Duodecimal: -12B48

Hexadecimal: -64e8

Square: 667292224

Square Root: 160.72336482291553

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 times an evil number is encountered when iterating from 2ⁿ⁺¹-2 to (2ⁿ)-2 with the map x -> x - (number of runs in binary representation of x). A255063

T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with the (lower) medians of each row equal and of each column equal. A237745

For 1<=x<=n, 1<=y<=n with gcd(x,y)=1, write 1 = gcd(x,y) = u·x+v·y with u,v minimal; a(n) = m²*s, where s is the population variance of the values of v and m is the number of such values. A345693

Triangle of coefficients of polynomials v(n,x) jointly generated with A210603; see the Formula section. A210738

G.f.: ∏_n=-oo..+oo (1 + xⁿ*(1 + xⁿ)ⁿ). A293603

Maximum cycle size in range [A014137(n-1)..A014138(n-1)] of permutation A125985/A125986. A126292

Number of (n+2)X(1+2) 0..1 arrays with the (lower) medians of each row equal and of each column equal. A237740

Number of 2 X n integer arrays with each element equal to the number of horizontal and antidiagonal neighbors not equal to itself. A265992

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

Number of permutations of floor(i·8/5), i=0..n-1, with all sums of 3 adjacent terms unique. A152326