Properties of the Number -25675

Twenty-Five Thousand Six Hundred Seventy-Five

Basics

Value: -25676 → -25675 → -25674

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 5 ² × 13 × 79

Divisors: 1, 5, 13, 25, 65, 79, 325, 395, 1027, 1975

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -110010001001011

Octal: -62113

Duodecimal: -12A37

Hexadecimal: -644b

Square: 659205625

Square Root: 160.23420358962065

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

Powers of cube root of 6 rounded down. A17991

Number of terms in 5th derivative of a function composed with itself n times. A22815

Smallest multiple of n beginning with n and having a digit sum n, or 0 if no such number exists. A77727

a(n) = binomial(n+5,5) + 4·binomial(n+4,5) + 4·binomial(n+3,5) + binomial(n+2,5). A244864

Centered cubohemioctahedral numbers: a(n) = 2·n³+9·n²+n+1. A274973

a(n) is the row of the Trithoff (tribonacci) array that contains the tails of the sequence which is n times the tribonacci numbers. A351685

a(n) = ∑_t=0..n g(t)*g(n-t) where g(t) = A002121(t). A2122

a(0) = 1, a(n+1) = 3·a(n) - F(n)*(F(n) + 1), where F(n) = A000045(n) is n-th Fibonacci number. A11769

Numbers k such that k² + 1 is composite and φ(k² + 1) == 0 (mod k). A67519

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