Properties of the Number 10070

Ten Thousand Seventy

Basics

Value: 10069 → 10070 → 10071

Parity: even

Prime: No

Previous Prime: 10069

Next Prime: 10079

Digit Sum: 8

Digital Root: 8

Palindrome: No

Factorization: 2 × 5 × 19 × 53

Divisors: 1, 2, 5, 10, 19, 38, 53, 95, 106, 190

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10011101010110

Octal: 23526

Duodecimal: 59B2

Hexadecimal: 2756

Square: 101404900

Square Root: 100.34938963441681

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

Numbers in which 0 outnumbers all other digits together. A292730

T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum equal to 0 3 5 6 or 8 and every 3X3 diagonal and antidiagonal sum not equal to 0 3 5 6 or 8. A252334

Number of partitions of n such that 2*(greatest part) > (number of parts). A237754

a(n) = 250·n - 180. A154360

Numbers n where abs(s(n)) produces a new minimum, with s(1) = 1 and s(i) = s(i-1) - sign(s(i-1))*(1/i). A203812

a(n) = ((n + 1) - 9*(n + 1)² + 8*(n + 1)³)/6. A331987

a(n) = ∑_{k=1..floor(n/2)} T(n, 2k), array T as in A049777. A49779

The Riordan square of the little Schröder numbers A001003. A172094

a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n-k+1), where k = floor(n/2), s = natural numbers, t = odd natural numbers. A24862

4-almost primes equal to the product of two successive semiprimes. A108215