Properties of the Number 80199

Eighty Thousand One Hundred Ninety-Nine

Basics

Value: 80198 → 80199 → 80200

Parity: odd

Prime: No

Previous Prime: 80191

Next Prime: 80207

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 7 × 19 × 67

Divisors: 1, 3, 7, 9, 19, 21, 57, 63, 67, 133

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10011100101000111

Octal: 234507

Duodecimal: 3A4B3

Hexadecimal: 13947

Square: 6431879601

Square Root: 283.1942796032434

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 semi-lone-child-avoiding rooted trees with at most one distinct non-leaf branch directly under any vertex. A331933

Odd numbers m such that σ(x) = m has more than 1 solution. A300869

Intersection of A065764 and A065765: n such that·and y exist with σ[x²] = n = σ[2*(y²)]. A65767

a(n) = sqrt(σ(2·m²)), where m = A097023(n), i.e., σ(2·m²) is a square. A163764

Numbers k such that if you subtract k from its reversal you get a positive number with the same digits as k. A121970

Take a <= b such that f(a)+f(b)=concatenation of a and b, where f(k)=k(k+3)/2 (A000096). Sequence gives values of b. A99149

a(n) = smallest number greater than n, equal to the determinant of the circulant matrix formed by its base-n digits. A219357

a(1)=1; for n>1, a(n)=a(n-1) - 3 if n is already in the sequence, a(n)=a(n-1) + 6 otherwise. A80199

a(n) is the smallest number k for which the smallest part of the symmetric representation of σ of k, SRS(k), has size n. If no such number exists, a(n) = -1. A386608