Properties of the Number 10370

Ten Thousand Three Hundred Seventy

Basics

Value: 10369 → 10370 → 10371

Parity: even

Prime: No

Previous Prime: 10369

Next Prime: 10391

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 2 × 5 × 17 × 61

Divisors: 1, 2, 5, 10, 17, 34, 61, 85, 122, 170

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10100010000010

Octal: 24202

Duodecimal: 6002

Hexadecimal: 2882

Square: 107536900

Square Root: 101.83319694480774

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

Coordination sequence for body-centered tetragonal lattice. A8527

a(n) = prime(n+1)² + prime(n)². A69484

Expansion of 1/(1 - x² - x⁷ - x¹² + x¹⁴) (a Salem polynomial). A143619

Least number having n orderless representations as p² + q², where p and q are primes. A214511

a(n) = n·Fibonacci(n-2) + ((-1)ⁿ + 1)/2. A323812

Numbers k such that the cumulative sums of the k-th composition in graded reverse lexicographic order ("standard order", see A066099) do not cover all residue classes modulo p for any prime p; i.e., such that (0, x₁, ..., x₁+...+x_j) is an admissible prime tuple pattern, where (x₁, ..., x_j) is the k-th composition. A387383

a(1) = 1, a(2) = 0; for n > 2, a(n) = n·Fibonacci(n-2) (with the convention Fibonacci(0)=0, Fibonacci(1)=1). A6490

Triangle T(n,k) (n>=0, 0 <= k <= n) read by rows giving number of underdiagonal lattice paths from (0,0) to (n,k) using only steps R=(1,0), V=(0,1) and D=(1,2). A71943

Row sums of triangle A117401: a(n) = ∑_k=0..n 2^(n-k*k) for n>=0. A117402

a(0) = 1, a(n) = 32·n² + 2 for n > 0. A10021