Properties of the Number -30028

Thirty Thousand Twenty-Eight

Basics

Value: -30029 → -30028 → -30027

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 ² × 7507

Divisors: 1, 2, 4, 7507, 15014, 30028

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -111010101001100

Octal: -72514

Duodecimal: -15464

Hexadecimal: -754c

Square: 901680784

Square Root: 173.28589094326173

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.: ∑_n>=1 ∑_k=0..n binomial(n,k) * x^k² * (xⁿ - x^k)^n-k, ignoring the constant term. A292808

Numbers k such that A003415(k) == A276085(k) (mod 2310), where A003415 is the arithmetic derivative and A276085 is the primorial base log-function. A391864

Number of partitions p of n such that (sum of parts with multiplicity 1) > (sum of all other parts). A240451

Number of partitions p of n such that (sum of parts with multiplicity 1) >= (sum of all other parts). A240452

Lexicographically earliest sequence of distinct positive integers with no finite subset summing to a primorial number (A002110). A353980

The least integer k >= 0 for which A328578(k) = A257993(A276086(A276086(k))) = n. A328761

a(n) = A108951(n) - A373158(n), where A108951 is fully multiplicative and A373158 is fully additive with a(p) = p# for prime p, where x# is the primorial A034386(x). A373984

a(n) = φ(prime(n)#-1) where φ is the Euler totient function and p# is the product of all the primes from 2 to p inclusive. A366810