Properties of the Number 13071

Thirteen Thousand Seventy-One

Basics

Value: 13070 → 13071 → 13072

Parity: odd

Prime: No

Previous Prime: 13063

Next Prime: 13093

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 3 × 4357

Divisors: 1, 3, 4357, 13071

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11001100001111

Octal: 31417

Duodecimal: 7693

Hexadecimal: 330f

Square: 170851041

Square Root: 114.32847414358332

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) = floor(sqrt(n⁷)). A155014

Least number·such that xⁿ has n digits equal to k. Case k = 7. A285454

a(n) is the least positive integer such that nextprime(a(n)ⁿ) - prevprime(a(n)ⁿ) = 4. A90125

G.f. satisfies: A(x/A(x)³) = G(x) where G(x) = 1 + x·G(x)³ is the g.f. of A001764. A168478

Number of asymmetric n-ominoes in n-2 space. A36366

Powers of sqrt(15) rounded down. A17949

Powers of sqrt(15) rounded to nearest integer. A17950

Indices k such that A020507(k)=φ[k](-8) is prime, where φ is a cyclotomic polynomial. A138922

Number of 1X6 integer matrices with each row summing to zero, row elements in nondecreasing order, rows in lexicographically nondecreasing order, and the sum of squares of the elements <= 2·n² (number of collections of 1 zero-sum 6-vectors with total modulus squared not more than 2·n², ignoring vector and component permutations). A192693

Number of length n+2 0..1 arrays with at most two downsteps in every n consecutive neighbor pairs. A256817