Properties of the Number -175896

One Hundred Seventy-Five Thousand Eight Hundred Ninety-Six

Basics

Value: -175897 → -175896 → -175895

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 36

Digital Root: 9

Palindrome: No

Factorization: 2 ³ × 3 ² × 7 × 349

Divisors: 1, 2, 3, 4, 6, 7, 8, 9, 12, 14

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -101010111100011000

Octal: -527430

Duodecimal: -85960

Hexadecimal: -2af18

Square: 30939402816

Square Root: 419.3995708152311

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

Nondescending wiggly sums: number of sums adding to n in which terms alternately do not decrease and do not increase. A129852

Triangle of numbers a(n,k), 0 <= k <= n: number of set partitions of {1,2,...,n} in which exactly k of the blocks have been distinguished. A49020

Number of driving-point impedances of an n-terminal network. A3128

Triangle read by rows of partial Bell polynomials B_n,k(x₁,...,x_n-k+1) evaluated at 2, 2, 12, 72, ..., (n-k)(n-k+1)!, divided by (n-k+1)!, n >= 1, 1 <= k <= n. A353132

Triangular T(n,k) which contains in column k >= 0 the elements of the Stirling transform of the unsigned sequence Stirling1(j+k,j), j >= 0. A118984

Triangle read by rows: T(n,k) = ∑_j=k..n binomial(n,j)*Stirling₂(j,k)*Bell(n-j), where Bell(n) = A000110(n), for n >= 1, 0 <= k <= n-1. A244489