Properties of the Number 38076

Thirty-Eight Thousand Seventy-Six

Basics

Value: 38075 → 38076 → 38077

Parity: even

Prime: No

Previous Prime: 38069

Next Prime: 38083

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 2 ² × 3 × 19 × 167

Divisors: 1, 2, 3, 4, 6, 12, 19, 38, 57, 76

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1001010010111100

Octal: 112274

Duodecimal: 1A050

Hexadecimal: 94bc

Square: 1449781776

Square Root: 195.13072541247828

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

Triangle read by rows: T(n,k) is the number of c-nets with n+1 faces and k+1 vertices. A290326

Total number of positive integers below 10ⁿ requiring 5 positive cubes in their representation as sum of cubes. A181381

Trisection of A107926: The least number k such that there are primes p and q with p - q = 6·n+4, p + q = k, and p the least such prime >= k/2. A234956

Expansion of (1 + 7·x)/(1 - 11·x - 26·x²). A153709

Triangle read by rows: T(n,k) is the number of c-nets with n+1 faces and k+1 vertices, 1 <= k <= n. But see A290326 for a better version. A210252

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 345", based on the 5-celled von Neumann neighborhood. A271295

Length of lists created by n substitutions k -> Range[k+1,-Abs[k],-2] starting with {1}. A84083

Number of rooted identity trees with 3-colored leaves. A38076

Consider the graph whose vertices are the points of the n-dimensional cubic lattice with points connected by all integer-length diagonals that traverse all n dimensions and do not intersect intermediate points. a(n) is the total length of the shortest possible closed walk in this graph via noncongruent diagonals of the same length. A385525

All integers k that can produce a closed walk in a square lattice via noncongruent primitive k-length hypotenuses, in ascending order. A386671