Properties of the Number -59671

Fifty-Nine Thousand Six Hundred Seventy-One

Basics

Value: -59672 → -59671 → -59670

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 59671

Divisors: 1, 59671

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8109 Try Today's Challenge

Representations

Binary: -1110100100010111

Octal: -164427

Duodecimal: -2A647

Hexadecimal: -e917

Square: 3560628241

Square Root: 244.27648269941992

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

Primes that remain prime through 4 iterations of function f(x) = 9x + 2. A23324

Upper twin primes of upper twin prime index. A88463

Primes with 12 as smallest positive primitive root. A61325

Triangle read by rows: T(n,k) is the number of set partitions of {1,2,...,n} (or of any n-set) having k blocks of odd size (0<=k<=n). A124321

Number of n-move bishop paths on 8x8 board from given corner to any square. A25592

Number of partitions of a 2·n-element set with exactly two odd blocks. A96619

Primes p whose smallest positive primitive root (mod p) is not squarefree. A205581

Number of n X 3 arrays of the minimum value of corresponding elements and their horizontal, vertical, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..1 n X 3 array. A219349

Smallest n such that π(n)=Floor[n/log((n-π(n))/e)]. A135325

Numbers n of the form 4·k+3 such that 2^m-1 == 1 (mod m) where m = (2·n-1)*n. A187923