Properties of the Number -42524

Forty-Two Thousand Five Hundred Twenty-Four

Basics

Value: -42525 → -42524 → -42523

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: Yes

Factorization: 2 ² × 10631

Divisors: 1, 2, 4, 10631, 21262, 42524

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1010011000011100

Octal: -123034

Duodecimal: -20738

Hexadecimal: -a61c

Square: 1808290576

Square Root: 206.21348161553357

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

Triangle read by rows: T(n,k) is the number of primitive (aperiodic) word structures of length n using exactly k different symbols. A137651

T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000000 or 00000001. A259642

Aliquot sequence starting at 660. A14362

a(n) = n*(n⁴ + 10·n³ + 35·n² + 50·n + 144)/120. A51745

Number of primitive (aperiodic) palindromic structures using exactly five different symbols. A56484

Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-2) + n, where a(0) = 1, a(1) = 3, b(0) = 2, b(1) = 4. A293349

Number of primitive (aperiodic) word structures of length n which contain exactly five different symbols. A56281

Number of binary strings of length n with equal numbers of 0001 and 0111 substrings. A164160

Sequence defined by the recurrence formula a(n+1)=sum(a(p)*a(n-p)+k,p=0..n)+l for n>=1, with here a(0)=1, a(1)=4, k=-1 and l=0. A176858

Number of (n+2)X(4+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000000 or 00000001. A259638