Properties of the Number 38052

Thirty-Eight Thousand Fifty-Two

Basics

Value: 38051 → 38052 → 38053

Parity: even

Prime: No

Previous Prime: 38047

Next Prime: 38053

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 ² × 3 ² × 7 × 151

Divisors: 1, 2, 3, 4, 6, 7, 9, 12, 14, 18

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 1001010010100100

Octal: 112244

Duodecimal: 1A030

Hexadecimal: 94a4

Square: 1447954704

Square Root: 195.0692184841063

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

Numbers that are the sum of seven fourth powers in eight or more ways. A345574

Numbers that are the sum of seven fourth powers in exactly eight ways. A345830

A diagonal in the array A158825 of coefficients of successive iterations of x·C(x), where C(x) is the Catalan function (A000108). A158833

a(1) = 1, a(2) = 7, a(n+2) = 7·a(n+1) + (n+1)²*a(n). A142981

Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 419", based on the 5-celled von Neumann neighborhood. A282072

Viggo Brun's ternary continued fraction algorithm applied to { log 2, log 3/2, log 5/4 } produces a list of triples (p,q,r); sequence gives p values. A359742

Expansion of (∑_n=-inf..inf x^n²)^-14. A4415

Terms of A319928 that are congruent to 4 modulo 8: Numbers k == 4 (mod 8) such that there is no other m such that (Z/mZ)* is isomorphic to (Z/kZ)*, where (Z/kZ)* is the multiplicative group of integers modulo k. A372755

Let Product[1+Sum[b(i,j) x^i·j,{i,1,Infinity}],{j,1,Infinity}]=1+Sum[c(n) xⁿ,{n,1,Infinity}], where b(i,j) is plus or minus one and c(n) is plus or minus one or zero. Furthermore, let b(1,1)=1 (for definiteness). Then, for a given n, a(n) is the number of ways in which the coefficients b(i,j) i<=n, j<=n can be chosen. A88857

Square array of coefficients in the successive iterations of x·C(x) = (1-sqrt(1-4·x))/2 where C(x) is the g.f. of the Catalan numbers (A000108); read by antidiagonals. A158825