Properties of the Number 38194

Thirty-Eight Thousand One Hundred Ninety-Four

Basics

Value: 38193 → 38194 → 38195

Parity: even

Prime: No

Previous Prime: 38189

Next Prime: 38197

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 × 13 ² × 113

Divisors: 1, 2, 13, 26, 113, 169, 226, 338, 1469, 2938

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1001010100110010

Octal: 112462

Duodecimal: 1A12A

Hexadecimal: 9532

Square: 1458781636

Square Root: 195.4328529188478

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

a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 3, where m = 2·n - 3 - 2^p+1 and p is the unique integer such that 2^p < n - 1 <= 2^p+1 with a(1) = a(2) = 1. A49940

Number of 3-cycles in the n X n black bishop graph. A289161

a(n) = T(n,[ n/2 ]), where T is the array defined in A024996. A26078

Lexicographical-support sequence T(n,k), n,k nonnegative: total number of checks required by a "lexicographical" algorithm to find out which rows and columns of each of the n by k zero-one matrices are nonzero. A58547

Number of unlabeled loopless multigraphs with n nodes of degree n or less. A333898

Iterated sum-of-digits of n-th prime; or digital root of n-th prime; or n-th prime modulo 9. A38194

Number of ways to place 5 nonattacking kings on an n X n board. A61998

Array read by antidiagonals: T(n,k) is the number of unlabeled loopless multigraphs with n nodes of degree k or less. A333893