Properties of the Number -41433

Forty-One Thousand Four Hundred Thirty-Three

Basics

Value: -41434 → -41433 → -41432

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 7 × 1973

Divisors: 1, 3, 7, 21, 1973, 5919, 13811, 41433

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1010000111011001

Octal: -120731

Duodecimal: -1BB89

Hexadecimal: -a1d9

Square: 1716693489

Square Root: 203.55097641622848

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

T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 1 and 0 1 0 vertically. A208369

Fibonacci sequence beginning 13, 8. A206610

G.f. A(x) satisfies: 1 = A(x) - x/(A(x) - x·A(x)/(A(x) - x·A(x)²/(A(x) - x·A(x)³/(A(x) - x·A(x)⁴/(A(x) ...))))), a continued fraction relation. A338747

Number of nX4 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 1 and 0 1 0 vertically. A208365

Number of 6Xn 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 1 and 0 1 0 vertically. A208372

Number of ways that n can be expressed as a sum of consecutive integers from 0 up to at most n, where any of the terms in the sum can be negated, and the partial sum from 0 is always between 0 and n inclusive. A364721

Number of n X n binary arrays symmetric about both diagonal and antidiagonal with all ones connected only in a 0110-1100-0111 pattern in any orientation. A146803