Properties of the Number -189695

One Hundred Eighty-Nine Thousand Six Hundred Ninety-Five

Basics

Value: -189696 → -189695 → -189694

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 38

Digital Root: 2

Palindrome: No

Factorization: 5 × 11 × 3449

Divisors: 1, 5, 11, 55, 3449, 17245, 37939, 189695

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -101110010011111111

Octal: -562377

Duodecimal: -9193B

Hexadecimal: -2e4ff

Square: 35984193025

Square Root: 435.5398948431705

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 permutations of {1,2,...,n} having k nonincreasing odd cycles (0<=k<=floor(n/3)). A cycle (b(1), b(2), ...) is said to be increasing if, when written with its smallest element in the first position, it satisfies b(1)<b(2)<b(3)<... . A cycle is said to be odd if it has an odd number of entries. For example, the permutation (152)(347)(6)(8) has 1 nonincreasing odd cycle. A186766

G.f. A(x) satisfies 1 - x = ∑_n>=0 (-1)^{n mod 3} * xⁿ * A(x)^n². A387475