Properties of the Number -39169

Thirty-Nine Thousand One Hundred Sixty-Nine

Basics

Value: -39170 → -39169 → -39168

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 13 × 23 × 131

Divisors: 1, 13, 23, 131, 299, 1703, 3013, 39169

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8109 Try Today's Challenge

Representations

Binary: -1001100100000001

Octal: -114401

Duodecimal: -1A801

Hexadecimal: -9901

Square: 1534210561

Square Root: 197.9115964262832

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

Number of fixed 2-dimensional triangular-celled animals with n cells (n-iamonds, polyiamonds) in the 2-dimensional hexagonal lattice. A1420

Smallest number k such that n! + k is a square. A68869

Expansion of x/(1 - x - 2·x³ - 2·x⁵ - x⁷). A143373

Number of 1's in n-th term of A006711. A22477

a(n) = 68·n² + 1. A158732

Odd composite integers m such that U(m)² == 1 (mod m) and V(m) == 6 (mod m), where U(m) and V(m) are the m-th generalized Lucas and Pell-Lucas numbers of parameters a=6 and b=-1, respectively. A337629

Indices of primes in sequence defined by A(0) = 67, A(n) = 10·A(n-1) - 23 for n > 0. A101529

Number of -3..3 arrays x(i) of n+1 elements i=1..n+1 with set{t,u,v in 0,1}((x[i+t]+x[j+u]+x[k+v])*(-1)^t+u+v) having one, two, three, four, five or six distinct values for every i,j,k<=n. A211736

Least number k >= 0 such that n! + k is a perfect power. A240939

G.f. A(x) satisfies: A(x) = x·exp(∑_k>=1 (A(x^k) + sigma₂(k)*x^k)/k). A307976