Properties of the Number -68295

Sixty-Eight Thousand Two Hundred Ninety-Five

Basics

Value: -68296 → -68295 → -68294

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 30

Digital Root: 3

Palindrome: No

Factorization: 3 × 5 × 29 × 157

Divisors: 1, 3, 5, 15, 29, 87, 145, 157, 435, 471

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8109 Try Today's Challenge

Representations

Binary: -10000101011000111

Octal: -205307

Duodecimal: -33633

Hexadecimal: -10ac7

Square: 4664207025

Square Root: 261.3331207482129

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

Number of connected labeled graphs with n edges and n nodes. A57500

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

Triangle read by rows: T(n,k) is the number of connected labeled graphs with n edges and k vertices, 1 <= k <= n+1. A343088

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

Triangle read by rows: T(n,m) = number of graphs on n labeled nodes, with m components of size = order. Also number of graphs on n labeled nodes with m unicyclic components. A106239

Triangle read by rows: T(n,k) is the number of labeled connected planar graphs on n vertices and k edges. A288265