Properties of the Number -40522

Forty Thousand Five Hundred Twenty-Two

Basics

Value: -40523 → -40522 → -40521

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 × 20261

Divisors: 1, 2, 20261, 40522

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1001111001001010

Octal: -117112

Duodecimal: -1B54A

Hexadecimal: -9e4a

Square: 1642032484

Square Root: 201.30076999355964

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

Expansion of φ(-x³) * f(-x, -x⁵) / ψ(x) in powers of·where φ(), ψ(), f(, ) are Ramanujan θ functions. A262614

a(n) = index of second occurrence of A161926(n) in A114381. A161927

Start with a 2 X n array of squares, join every vertex on top edge to every vertex on bottom edge; a(n) = one-half the number of cells. A355902

Floor(1/{(5+n⁴)^1/4}), where {}=fractional part. A184629

Number of 10 X 2 integer matrices with each row summing to zero, row elements in nondecreasing order, rows in lexicographically nondecreasing order, and the sum of squares of the elements <= 2·n² (number of collections of 10 zero-sum 2-vectors with total modulus squared not more than 2·n², ignoring vector and component permutations). A192711

a(n) counts anti-chains of size three in "0,1,2" Motzkin trees on n edges. A335349