Properties of the Number 38958

Thirty-Eight Thousand Nine Hundred Fifty-Eight

Basics

Value: 38957 → 38958 → 38959

Parity: even

Prime: No

Previous Prime: 38953

Next Prime: 38959

Digit Sum: 33

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 43 × 151

Divisors: 1, 2, 3, 6, 43, 86, 129, 151, 258, 302

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1001100000101110

Octal: 114056

Duodecimal: 1A666

Hexadecimal: 982e

Square: 1517725764

Square Root: 197.37781030298214

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 subsets of {1..n} containing n such that no element is a sum of distinct other elements. A variation of non-binary sum-free subsets without re-usable elements. A365071

Brent's irregular triangle T[r,k] related to Hardy-Littlewood constants of prime gaps 2r. A381083

Column k=3 of Brent's table A381083 related to prime gaps 2n. A381086

Square array A(n,k), n>=1, k>=1, read by antidiagonals: A(n,k) is 1/(2·n) times the number of n-colorings of the complete tripartite graph K_k,k,k. A212221

Number of 4-balanced strings of length n: let d(S)= #(1)'s in S - #(0)'s, then S is k-balanced if every substring T has -k<=d(T)<=k; here k=4. A27559

T₇(n) in the notation of Bergeron et al., u_k(n) in the notation of Gessel: Related to Young tableaux of bounded height. A72131

Number of ways to place 7 nonattacking wazirs on a 7 X n board. A172234

Number of permutations in S_n containing an increasing subsequence of length 8. A217675

Primes p such that 73 is not a square mod p. A38958