Properties of the Number 10338

Ten Thousand Three Hundred Thirty-Eight

Basics

Value: 10337 → 10338 → 10339

Parity: even

Prime: No

Previous Prime: 10337

Next Prime: 10343

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 1723

Divisors: 1, 2, 3, 6, 1723, 3446, 5169, 10338

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10100001100010

Octal: 24142

Duodecimal: 5B96

Hexadecimal: 2862

Square: 106874244

Square Root: 101.67595585978034

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

Record gaps between twin primes. A113274

Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 100. A31598

Triangle read by rows: number of Dyck paths of semilength n having k 3-bridges of a given shape (0<=k<=floor(n/3)). A 3-bridge is a subpath of the form UUUDDD or UUDUDD starting at level 0. A114499

"666" in bases 7 and higher rewritten in base 10. A121205

a(n) is the number of primes q less than primorial(n) having k = 2 as the least exponent such that q^k == 1 (mod primorial(n)). A336016

a(n) is the smallest number k such that ∑_j=1..k (-1)^ω(j) = -n, where ω(j) is the number of distinct primes dividing j. A346456

Number of homogeneous primitive partition identities of degree 6 with largest part n. A7344

Number of n X 2 0..3 arrays with no element equal to zero plus the sum of elements to its left or one plus the sum of elements above it or three plus the sum of the elements diagonally to its northwest, modulo 4. A240187

Integers that concatenate 3 counts: the number of terms in the sequence so far, the number of primes in the sequence so far, the number of digits in the sequence so far, with a(1)= 113. The sequence is always extended with the smallest available integer not leading to a contradiction or a dead end. A309617

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (0, 1, -1), (1, 0, 0), (1, 1, -1), (1, 1, 1)}. A150632