Properties of the Number -35182

Thirty-Five Thousand One Hundred Eighty-Two

Basics

Value: -35183 → -35182 → -35181

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 × 7 ² × 359

Divisors: 1, 2, 7, 14, 49, 98, 359, 718, 2513, 5026

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1000100101101110

Octal: -104556

Duodecimal: -1843A

Hexadecimal: -896e

Square: 1237773124

Square Root: 187.56865409763967

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

Weighted count of partitions with distinct parts. A5895

T(n,k) = number of defective 3-colorings of an n X k 0..2 array connected horizontally and vertically with exactly two mistakes, and colors introduced in row-major 0..2 order. A229606

Number of defective 3-colorings of an n X 4 0..2 array connected horizontally and vertically with exactly two mistakes, and colors introduced in row-major 0..2 order. A229602

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 529", based on the 5-celled von Neumann neighborhood. A272748

Number of defective 3-colorings of an n X n 0..2 array connected horizontally and vertically with exactly two mistakes, and colors introduced in row-major 0..2 order. A229599

Triangle read by rows, T(n,k) with n,k > 1, is the number of subsequences of length k over all permutations of [n], which are neither increasing or decreasing. A373766