Properties of the Number -34561

Thirty-Four Thousand Five Hundred Sixty-One

Basics

Value: -34562 → -34561 → -34560

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 17 × 19 × 107

Divisors: 1, 17, 19, 107, 323, 1819, 2033, 34561

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1000011100000001

Octal: -103401

Duodecimal: -18001

Hexadecimal: -8701

Square: 1194462721

Square Root: 185.9058901702687

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) = 2·a(n-1) + 5·a(n-2), with a(0) = a(1) = 1. A2533

Bruckman-Lucas pseudoprimes: k | (L_k - 1), where k is composite and L_k = Lucas numbers A000032. A5845

Odd Fibonacci pseudoprimes: odd composite numbers k such that either (1) k divides Fibonacci(k-1) if k == +-1 (mod 5) or (2) k divides Fibonacci(k+1) if k == +-2 (mod 5). A81264

Numbers m such that the factorizations of m..m+4 have the same number of primes (including multiplicities). A45941

Composite numbers k such that k divides F(k-1) where F(j) are the Fibonacci numbers. A69106

Odd composite integers m such that F(m)² == 1 (mod m), where F(m) is the m-th Fibonacci number. A337231

Composite n coprime to 5 such that Fibonacci(n) == Legendre(n,5) (mod n). A49062

Odd composites m that divide Fibonacci(m)-1. A94394

NSW pseudoprimes: odd composite numbers k such that A002315((k-1)/2) == 1 (mod k). A330276

Frobenius pseudoprimes with respect to Fibonacci polynomial x² - x - 1. A212424