Properties of the Number 73088

Seventy-Three Thousand Eighty-Eight

Basics

Value: 73087 → 73088 → 73089

Parity: even

Prime: No

Previous Prime: 73079

Next Prime: 73091

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 2 ⁷ × 571

Divisors: 1, 2, 4, 8, 16, 32, 64, 128, 571, 1142

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10001110110000000

Octal: 216600

Duodecimal: 36368

Hexadecimal: 11d80

Square: 5341855744

Square Root: 270.34792397945284

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 non-crossing connected graphs on n nodes on a circle in which the root (a distinguished node) has degree k (n >= 2, 1 <= k <= n-1). A143022

a(n) = n·a(n-1)+4·a(n-2)-4*(n-2)*a(n-3). A80252

a(n) = 2·a(n-1) + 2·a(n-2), a(0)=0, a(1)=4. A116556

4 X 4 X 4 triangular graph without horizontal edges coloring a rectangular array: number of n X 1 0..9 arrays where 0..9 label nodes of a graph with edges 0,1 0,2 1,3 1,4 2,4 2,5 3,6 3,7 4,7 4,8 5,8 5,9 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph. A223408

T(n,k)=4X4X4 triangular graph without horizontal edges coloring a rectangular array: number of nXk 0..9 arrays where 0..9 label nodes of a graph with edges 0,1 0,2 1,3 1,4 2,4 2,5 3,6 3,7 4,7 4,8 5,8 5,9 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph. A223415

Sum of first n terms of the simple continued fraction of ∑_k>=0 1/2^{2^k} (cf. A007400). A73088