Properties of the Number 66808

Sixty-Six Thousand Eight Hundred Eight

Basics

Value: 66807 → 66808 → 66809

Parity: even

Prime: No

Previous Prime: 66797

Next Prime: 66809

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 2 ³ × 7 × 1193

Divisors: 1, 2, 4, 7, 8, 14, 28, 56, 1193, 2386

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10000010011111000

Octal: 202370

Duodecimal: 327B4

Hexadecimal: 104f8

Square: 4463308864

Square Root: 258.47243566771294

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

Coordination sequence for (2,5,infinity) tiling of hyperbolic plane. A265068

Triangle T(n,k) = number of forests of labeled rooted trees of height at most 1, with n labels, k of which are used for root nodes and any root may contain >= 1 labels, n >= 0, 0<=k<=n. A143396

a(n) = prime(prime(prime(A028815(n) - 1) - 1) - 1) - 1. A141133

Expansion of 1/( (1-x) * (1-x-9·x³)² )^1/3. A383606

Number of forests of labeled rooted trees of height at most 1, with n labels, six of which are used for root nodes and any root may contain >= 1 labels. A273656

Numbers k such that k and k² use only the digits 0, 3, 4, 6 and 8. A136931

a(n) = F(n)-1 mod 2ⁿ+1 with F(n) = n-th Fermat number = 1+2²^n. A66808