Properties of the Number 38199

Thirty-Eight Thousand One Hundred Ninety-Nine

Basics

Value: 38198 → 38199 → 38200

Parity: odd

Prime: No

Previous Prime: 38197

Next Prime: 38201

Digit Sum: 30

Digital Root: 3

Palindrome: No

Factorization: 3 × 7 × 17 × 107

Divisors: 1, 3, 7, 17, 21, 51, 107, 119, 321, 357

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1001010100110111

Octal: 112467

Duodecimal: 1A133

Hexadecimal: 9537

Square: 1459163601

Square Root: 195.44564461762764

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 polyhexes of class PF2 (with two catafusenes annealated to pyrene). A26118

Numbers n such that n+/-2 and n²+/-2 are all primes. A189051

a(n) = -∑_k=0..n binomial(n, k)*A226158(k). A239977

Numbers k such that 3·10^k + 5·R_k + 2 is prime, where R_k = 11...1 is the repunit (A002275) of length k. A102972

Quadruples of different integers from [ 2,n ] with no global factor. A15627

A generalized PolyLog triangular sequence of coefficients: k = (n + 1); b0 = 1; p(x,n,k)=(k - 1)!*(1 - x)ⁿ*PolyLog[ -n, k, x]/(x·Log[1 - x]); t(n,m)=Coefficients(p(b0,n,k)). A142336

Row sums of triangle T(m,n) = number of solutions to 1 <= a(1) < a(2) < ... < a(m) <= n, where gcd(a(1), a(2), ..., a(m), n) = 1, in A020921. A38199

Number of nX3 0..1 arrays with no 1 equal to more than one of its horizontal, vertical and antidiagonal neighbors, with the exception of exactly two elements. A282964