Properties of the Number -59916

Fifty-Nine Thousand Nine Hundred Sixteen

Basics

Value: -59917 → -59916 → -59915

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 30

Digital Root: 3

Palindrome: No

Factorization: 2 ² × 3 × 4993

Divisors: 1, 2, 3, 4, 6, 12, 4993, 9986, 14979, 19972

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1110101000001100

Octal: -165014

Duodecimal: -2A810

Hexadecimal: -ea0c

Square: 3589927056

Square Root: 244.77744994177874

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

G.f. A(x) satisfies A(x) = A(x²) - x·A(x²)³. A393196

T(n,k)=Number of nXk 0..3 arrays with some element plus some horizontally, antidiagonally or vertically adjacent neighbor totalling three no more than once. A269143

a(n) is the number of positive integers k for which ∑_i=1..j (p_i+e_i) = n, where p₁^e_1*...*p_j^e_j is the prime factorization of k. A382330

Expansion of g.f. A(x) satisfying A( x·A(x)² + A(x)⁴ ) = A(x)³. A372526

Number of n X 2 0..3 arrays with some element plus some horizontally, antidiagonally or vertically adjacent neighbor totalling three no more than once. A269137

Number of nX5 0..3 arrays with some element plus some horizontally, antidiagonally or vertically adjacent neighbor totalling three no more than once. A269140

T(n,n-2), array T given by A047010. A47014

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (0, 1, 1), (1, -1, 0), (1, 1, -1), (1, 1, 0)}. A150842