Properties of the Number -43335

Forty-Three Thousand Three Hundred Thirty-Five

Basics

Value: -43336 → -43335 → -43334

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ⁴ × 5 × 107

Divisors: 1, 3, 5, 9, 15, 27, 45, 81, 107, 135

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8109 Try Today's Challenge

Representations

Binary: -1010100101000111

Octal: -124507

Duodecimal: -210B3

Hexadecimal: -a947

Square: 1877922225

Square Root: 208.17060311196678

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 with each 1 adjacent to 1 or 2 king-move neighboring 1s. A295847

Number of subsets of {1,...,n} containing {a,a+2,a+4} for some a. A209409

Total sum of parts of multiplicity 8 in all partitions of n. A222736

Expansion of (1/x) * Series_Reversion( x * ( ∑_k=0..5 (-x)^k )³ ). A393660

Number of nondecreasing strings of numbers x(i=1..n) in -5..5 with sum x(i)³ equal to 0. A188273

Number of (n+4) X 10 0..1 matrices with each 5 X 5 subblock idempotent. A224688

Number of n X 3 0..1 arrays with each 1 adjacent to 1 or 2 king-move neighboring 1s. A295842

Number of nX7 0..1 arrays with each 1 adjacent to 1 or 2 king-move neighboring 1s. A295846

Let M(n) = {{n, 0, 1}, {1, 0, 0}, {0, 1, 0}}, then a(n) is the upper-right term of M(n)*M(n-1)*...*M(1). A130619