Properties of the Number -5725

Seven Hundred Twenty-Five

Basics

Value: -5726 → -5725 → -5724

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 5 ² × 229

Divisors: 1, 5, 25, 229, 1145, 5725

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1011001011101

Octal: -13135

Duodecimal: -3391

Hexadecimal: -165d

Square: 32775625

Square Root: 75.66372975210778

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) = 8·n² - 4·n + 1. A80856

Generalized 21-gonal (or icosihenagonal) numbers: m*(19·m - 17)/2 with m = 0, +1, -1, +2, -2, +3, -3, ... A303298

Smallest number that requires n iterations of the unitary totient function (A047994) to reach 1. A3271

Square array A(n,k) by antidiagonals. A(n,k) is the number of length 2n k-ary words (n,k>=0) that can be built by repeatedly inserting doublets into the initially empty word. A183135

21-gonal numbers: a(n) = n*(19n - 17)/2. A51873

a(n) = (prime(n)² + 1)/2. A66885

T(n,k)=Number of -k..k arrays x(0..n-1) of n elements with zero sum, and adjacent elements not both strictly positive and not both strictly negative. A199898

Third row of Pascal-(1,5,1) array A081580. A81589

Start with a(1) = 1; then a(n) = smallest number > a(n-1) such that a(n) divides concat(a(1), a(2), ..., a(n)). A171785

T(n,k)=Number of (n+1)X(k+1) 0..4 arrays with every 2X2 subblock summing to 8. A183652