Properties of the Number 38606

Thirty-Eight Thousand Six Hundred Six

Basics

Value: 38605 → 38606 → 38607

Parity: even

Prime: No

Previous Prime: 38603

Next Prime: 38609

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 × 97 × 199

Divisors: 1, 2, 97, 194, 199, 398, 19303, 38606

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1001011011001110

Octal: 113316

Duodecimal: 1A412

Hexadecimal: 96ce

Square: 1490423236

Square Root: 196.48409604850974

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

a(n) = b(A074483(n), n), where b(k) is the recursion: b(1,n)=1, b(k+1,n)=b(k,n) + (b(k,n) reduced mod(k+n)) (cf. A074482). A74484

Number of 6-element subsets of [n] having a prime element sum. A320681

Total number of palindromic primes in base 3 with n digits. A117776

Least k such that k-th prime > n·k. A38606

a(n+1) = a(n) + a(n) mod n; a(1) = 1. A73117

Positive integers m such that π(k³) + π(m³) is a cube for some k = 1,...,m, where π(x) denotes the number of primes not exceeding x. A262698

Consider the recursion b(1,n) = 1, b(k+1,n) = b(k,n) + (b(k,n) reduced mod(k+n)); then there is a number·such that b(k,n) - b(k-1,n) is a constant·depending only on n, for k > y = A074483(n). Sequence gives values of x. A74482

a(1) = 1; a(n) = (sum of previous terms) mod n. A94405

Consider the recursion b(1,n) = 1, b(k+1,n) = b(k,n) + (b(k,n) reduced mod(k+n)); then there is a number y such that b(k,n)-b(k-1,n) is a constant (= A074482(n)) for k > y. Sequence gives values of y. A74483

a(n) is the numerator of the expected number of restarts in the procedure described in A372422 if repeated until a single person has been selected. A372932