Properties of the Number -65171

Sixty-Five Thousand One Hundred Seventy-One

Basics

Value: -65172 → -65171 → -65170

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 65171

Divisors: 1, 65171

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1111111010010011

Octal: -177223

Duodecimal: -3186B

Hexadecimal: -fe93

Square: 4247259241

Square Root: 255.28611399760857

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

Triangle T(n,k) by rows: T(n, k) = (n-k+1)*T(n-1, k-1) + k·T(n-1, k) + T(n-2, k-1) with T(n, 1) = T(n, n) = 1. A144438

Lesser of twin primes for which φ(p-1) < φ(p+1). A286715

Lower twin primes with lower twin prime index. A88460

Lexicographically earliest permutation of the primes such that successive absolute differences yield a permutation of all nonprime numbers. A203985

Primes whose position in the Wythoff array is immediately followed by a prime both in the next column and the next row. A352537

a(n) equals the smallest Sophie Germain prime q such that pi_p,2p+1(q,10,(1,3)) - pi_p,2p+1(q,10,(3,1)) = n, where pi_p,2p+1(q,10,(b,c)) equals the number of Sophie Germain primes A005384(i) such A005384(i) <= q and (A005384(i),A005384(i+1)) == (b,c) (mod 10). A333084