Properties of the Number 88193

Eighty-Eight Thousand One Hundred Ninety-Three

Basics

Value: 88192 → 88193 → 88194

Parity: odd

Prime: No

Previous Prime: 88177

Next Prime: 88211

Digit Sum: 29

Digital Root: 2

Palindrome: No

Factorization: 7 × 43 × 293

Divisors: 1, 7, 43, 293, 301, 2051, 12599, 88193

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 10101100010000001

Octal: 254201

Duodecimal: 43055

Hexadecimal: 15881

Square: 7778005249

Square Root: 296.9730627514893

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 4-valent (or quartic) graphs with n nodes. A33301

Number of connected regular graphs of degree 9 with 2n nodes. A14381

Number of connected 9-regular simple graphs on 2n vertices with girth exactly 3. A184993

Number of connected k-regular graphs on 2·n nodes with maximal diameter D(n,k) A296525 written as array T(n,k), 2 <= k < 2·n. A296526

Quasi-Carmichael numbers to base -7: squarefree composites n such that prime p∣n ==> p+7∣n+7. A29567

Irregular triangle C(n,g) counting the connected 9-regular simple graphs on 2n vertices with girth at least g. A184991

Irregular triangle E(n,g) counting not necessarily connected 4-regular simple graphs on n vertices with girth at least g. A185340

Triangular array C(n, r) = number of connected r-regular graphs with n nodes, 0 <= r < n. A68934

Triangular array C(n,r) = number of connected r-regular graphs, having girth exactly 3, with n nodes, for 0 <= r < n. A186733

Prime numbers where the sequence of largest quadratic residues modulo the primes (A088190) is non-monotonic. A88193