Properties of the Number -116175

One Hundred Sixteen Thousand One Hundred Seventy-Five

Basics

Value: -116176 → -116175 → -116174

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 5 ² × 1549

Divisors: 1, 3, 5, 15, 25, 75, 1549, 4647, 7745, 23235

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -11100010111001111

Octal: -342717

Duodecimal: -57293

Hexadecimal: -1c5cf

Square: 13496630625

Square Root: 340.8445393430853

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

Triangular array giving number of labeled graphs on n unisolated nodes and k=0...n*(n-1)/2 edges. A54548

Triangular array T(n,k) giving number of connected graphs with n labeled nodes and k edges (n >= 1, 0 <= k <= n(n-1)/2). A62734

Triangular array T(n,k) giving number of connected graphs with n labeled nodes and k edges (n >= 1, n-1 <= k <= n(n-1)/2). A123527

Number of connected labeled graphs with n nodes and n+7 edges. A96150

Triangle T(m, n) = the number of point-labeled graphs with n points and m edges, no points isolated. By rows, n >= 0, ceiling(n/2) <= m <= binomial(n,2). A276639

Triangle T(n, k) = the number of point-labeled graphs with n points and k edges, no points isolated, no edges isolated. By rows, 0 <= n, ceiling(2·n/3) <= k <= binomial(n, 2). A276640