Properties of the Number 80005

Eighty Thousand Five

Basics

Value: 80004 → 80005 → 80006

Parity: odd

Prime: No

Previous Prime: 79999

Next Prime: 80021

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 5 × 16001

Divisors: 1, 5, 16001, 80005

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10011100010000101

Octal: 234205

Duodecimal: 3A371

Hexadecimal: 13885

Square: 6400800025

Square Root: 282.85155117128136

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 strict compositions of n with all adjacent parts (x, y) satisfying x < 2y and y < 2x. A342341

Denominators of continued fraction convergents to sqrt(926). A42791

Numbers n > 99 with following property: form a sequence whose initial terms are the t digits of n, later terms given by rule b(i+1) = b(i) + product of t-1 previous terms; then n itself appears in the sequence. A42983

Smith numbers with either no internal digits or all internal digits are 0. A204341

a(n) = 2*(3·n)! / ((2·n+1)!*(n+1)!). A139

Number of those nonnegative integer solutions of the congruence x₁+2x₂+...+(n-1)x_n-1 = 0 (mod n) which are indecomposable, that is, are not nonnegative linear combinations of other nonnegative integer solutions. A96337

Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=2, r=3, I={-1,1}. A80005

Tetrahedron T(m,n,k) in which the slice k is a finite triangle read by rows T(m, n). T(m,n,k) is the smallest v such that for every red-green-blue edge-coloring of the graph K_v there exists either a red m-cycle, a green n-cycle or a blue k-cycle; Ramsey number r(C_m, C_n, C_k). A389334

a(n) is the smallest m such that for every red-green-blue edge-coloring of the graph K_m there exists at least one red, green or blue n-cycle; Ramsey number r(C_n, C_n, C_n). A389335