Properties of the Number 71168

Seventy-One Thousand One Hundred Sixty-Eight

Basics

Value: 71167 → 71168 → 71169

Parity: even

Prime: No

Previous Prime: 71167

Next Prime: 71171

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 ⁹ × 139

Divisors: 1, 2, 4, 8, 16, 32, 64, 128, 139, 256

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10001011000000000

Octal: 213000

Duodecimal: 35228

Hexadecimal: 11600

Square: 5064884224

Square Root: 266.77331200852905

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 of the form p⁹*q where p and q are distinct primes. A179692

Recurrence sequence based on positions of digits in decimal places of Catalan's constant, G (often also called K). A98322

Triangle of coefficients of the polynomials (1 - x)ⁿ*A(n,x/(1 - x)), where A(n,x) are the Eulerian polynomials of A008292. A141720

Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 429", based on the 5-celled von Neumann neighborhood. A288193

For 1<=x<=n, 1<=y<=n with gcd(x,y)=1, write 1 = gcd(x,y) = u·x+v·y with u,v minimal; a(n) = m²*s, where s is the population variance of the values of |v| and m is the number of such values. A345695

Triangle read by rows, T(n,k) = ∑_j=0..n (-1)^n+k+j A(n,j)*C(j,n-k), A(n,j) the Eulerian numbers; n >= 0, k >= 0. A225678

Combinatorial twin prime formulas. This sequence gives the coefficients a(n) of combinatorial sum formulas of n-th twin primes or lesser: twin_prime(n) = 2^n-6/(n-1)! ∑_i=1..n a(i) * C(n-1,i-1) * (i+2-n). A119362

G.f. A(x) satisfies: [x^n-1] A(x)^n² = (n²)^n-1 for n>=1. A294360

n-th prime reduced modulo φ(n). A71168