Properties of the Number 38064

Thirty-Eight Thousand Sixty-Four

Basics

Value: 38063 → 38064 → 38065

Parity: even

Prime: No

Previous Prime: 38053

Next Prime: 38069

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 ⁴ × 3 × 13 × 61

Divisors: 1, 2, 3, 4, 6, 8, 12, 13, 16, 24

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1001010010110000

Octal: 112260

Duodecimal: 1A040

Hexadecimal: 94b0

Square: 1448868096

Square Root: 195.09997437211518

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

Values of the difference d for 6 primes in geometric-arithmetic progression with the minimal sequence {7·7^j + j·d}, j = 0 to 5. A209205

Values of the difference d for 7 primes in geometric-arithmetic progression with the minimal sequence {7·7^j + j·d}, j = 0 to 6. A209206

T(n,k) is the number of (n+1) X (k+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 5, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings). A235186

Triangle read by rows: T(n, k) = (2^n-k*3^k + 2^k*3^n-k)*binomial(n, k). A154692

a(n) = 25·n² + n. A173089

a(n) = 1521·n² + 39. A158768

Low-temperature susceptibility expansion for square lattice (Potts model, q=4). A57379

a(1) = 1, a(n) = ∑_k=1..π(n) a(n-k) for n > 1, where π(n) is the number of primes less than or equal to n. A123341

Largest k such that k! < 2^2ⁿ. A152909

Number of (n+1) X (1+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 5, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings). A235179