Properties of the Number -25665

Twenty-Five Thousand Six Hundred Sixty-Five

Basics

Value: -25666 → -25665 → -25664

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 5 × 29 × 59

Divisors: 1, 3, 5, 15, 29, 59, 87, 145, 177, 295

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -110010001000001

Octal: -62101

Duodecimal: -12A29

Hexadecimal: -6441

Square: 658692225

Square Root: 160.20299622666238

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) is both the sum of n+1 consecutive integers and the sum of the n immediately higher consecutive integers. A59270

Position of first appearance of each integer in A088568 (number of 1's minus number of 2's in first n terms of A000002). A288605

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the maximum plus the lower median of every 2X2 subblock equal. A237481

Least k such that the first k terms of the Kolakoski sequence (A000002) contain n more 2's than 1's. A25503

a(n) = index where A088568 (or equally A294448) first reaches or exceeds n in magnitude. A294449

Denominator of |Bernoulli(2n+2)| - |Bernoulli(2n)|. A29765

Numbers k such that k and k² use only the digits 2, 5, 6, 8 and 9. A137114

Number of binary strings of length n with no substrings equal to 0001 0011 or 1011. A164458

Number of (n+1)X(1+1) 0..2 arrays with the maximum plus the lower median of every 2X2 subblock equal. A237474

Number of (n+1)X(5+1) 0..2 arrays with the maximum plus the lower median of every 2X2 subblock equal. A237478