Properties of the Number -25282

Twenty-Five Thousand Two Hundred Eighty-Two

Basics

Value: -25283 → -25282 → -25281

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 × 12641

Divisors: 1, 2, 12641, 25282

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -110001011000010

Octal: -61302

Duodecimal: -1276A

Hexadecimal: -62c2

Square: 639179524

Square Root: 159.00314462299164

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) = 2·a(n-1) - a(n-4), where a(0) = 2, a(1) = 4, a(2) = 6, a(3) = 10. A288465

Number of positive integers with n digits in which adjacent digits differ by at most 4. A383199

Values of n such that A080221(n)=6; i.e., values of n such that n is divisible by the sum of digits of n when expressed in exactly 6 of the bases b=1...n. A271311

Numbers k such that 24·k-1 has at least three factors 7 and the partition function evaluated at k has at least the same number of factors 7 as 24·k-1. A340957

a(n) = Fibonacci(n) represented in bijective base-8 numeration. A282239

Sum of squares of cycle lengths for different cycles in Fibonacci-like sequences modulo n. A233246

G.f. satisfies A(x) = 1 + x·cycle_index(G,A(x)) where G = cyclic group of order 31 generated by (1,2,...,31). A36735

Number of permutations of 0..(n-1) representable as 1,3,3,1-weighted consecutive sums of 4 adjacent elements of a sequence of n+3 nonnegative integers. A180214