Properties of the Number -30217

Thirty Thousand Two Hundred Seventeen

Basics

Value: -30218 → -30217 → -30216

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 11 × 41 × 67

Divisors: 1, 11, 41, 67, 451, 737, 2747, 30217

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -111011000001001

Octal: -73011

Duodecimal: -155A1

Hexadecimal: -7609

Square: 913067089

Square Root: 173.83037709215267

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

Two-column table read by rows: Primitive distinct pairs that have the same value of φ, σ, and τ. A322688

Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 662", based on the 5-celled von Neumann neighborhood. A286759

Numbers n such that there is k < n for which A003557(k) = A003557(n), A048250(k) = A048250(n) and A173557(k) = A173557(n). A296087

Products of three distinct strong primes. A363782

G.f. A(x) satisfies: A(x)² = A( x²*(1+x)/(1-x) ), with A(0) = 0. A259117

a(n) = a(n-1) + 3·a(n-2) -2·a(n-3) - 2·a(n-4), where a(0) = 0, a(1) = 0, a(2) = 3, a(3) = 1. A295856

a(n) = (1/φ(n)) * ∑_j=1..n ∑_k=1..n φ(n·j*k). A372668

Convoluted convolved Fibonacci numbers G_j⁷. A89094

Number of n X n binary arrays symmetric under 180 degree rotation with all ones connected only in a 0110-0100-1111 pattern in any orientation. A146798

Series expansion of (1 + 2x + 4x²)/(1 - 3x - 5x²). A276139