Properties of the Number -30573

Thirty Thousand Five Hundred Seventy-Three

Basics

Value: -30574 → -30573 → -30572

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 43 × 79

Divisors: 1, 3, 9, 43, 79, 129, 237, 387, 711, 3397

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -111011101101101

Octal: -73555

Duodecimal: -15839

Hexadecimal: -776d

Square: 934708329

Square Root: 174.85136545077364

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

-3-Knödel numbers. A225507

Number of partitions of n into 8 distinct and relatively prime parts. A340719

Number of circular permutations of (0,1,...,n-1) with no consecutive triples i,i+d,i+2d for all d>0. A174082

G.f. A(x) satisfies: A(x) = 1 + x + x² + x³ + x⁴ * A(x/(1 - x)) / (1 - x)². A351707

a(n) is the number of distinct pairs that can be made in exactly n iterations of either of the two maps (x, y) -> (x OR (2^y), 0) or (x, y) -> (x, y+1), starting from (0,0). A353150

a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = 2·n - 2 - 2^p+1 and p is the unique integer such that 2^p < n - 1 <= 2^p+1, starting with a(1) = 1, a(2) = 3, and a(3) = 4. A49931

If p(x) is the x-th prime, then the n-th set of 4 consecutive sexy prime pairs starts at p(a(n)). A95963