Properties of the Number 38792

Thirty-Eight Thousand Seven Hundred Ninety-Two

Basics

Value: 38791 → 38792 → 38793

Parity: even

Prime: No

Previous Prime: 38791

Next Prime: 38803

Digit Sum: 29

Digital Root: 2

Palindrome: No

Factorization: 2 ³ × 13 × 373

Divisors: 1, 2, 4, 8, 13, 26, 52, 104, 373, 746

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1001011110001000

Octal: 113610

Duodecimal: 1A548

Hexadecimal: 9788

Square: 1504819264

Square Root: 196.95684806576287

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

T(n,k) = Number of n X k 0..1 arrays with the number of 1's horizontally or vertically adjacent to some 0 one less than the number of 0's adjacent to some 1. A284771

a(n) = floor( (4/3)*π*n³ ). A66645

Numbers n such that n and its digit reversal R(n) both are difference of positive cubes. A109879

Nearest integer to 4 * π * n³ / 3. A2101

Volume of sphere (rounded down) with the diameter equal to n. A228272

Least number of consecutive primes beginning with 2, the sum of which (A007504) is >= 2ⁿ. A323360

Number of n X 3 0..1 arrays with the number of 1's horizontally or vertically adjacent to some 0 one less than the number of 0's adjacent to some 1. A284766

Number of n X 6 0..1 arrays with the number of 1's horizontally or vertically adjacent to some 0 one less than the number of 0's adjacent to some 1. A284769

Rectangular array defined by T(i,1) = T(1,j) = 1 for i >= 1 and j >= 1; T(i,j) = max(T(i-1,j) + T(i-1,j-1), T(i-1,j-1) + T(i,j-1)) for i >= 2, j >= 2, read by antidiagonals. A38792