Properties of the Number -30032

Thirty Thousand Thirty-Two

Basics

Value: -30033 → -30032 → -30031

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 8

Digital Root: 8

Palindrome: No

Factorization: 2 ⁴ × 1877

Divisors: 1, 2, 4, 8, 16, 1877, 3754, 7508, 15016, 30032

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -111010101010000

Octal: -72520

Duodecimal: -15468

Hexadecimal: -7550

Square: 901921024

Square Root: 173.29743217947575

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

Primorial base log-function: fully additive with a(p) = p#/p, where p# = A034386(p). A276085

Number of integer partitions of n where the parts do not have the same mean as the distinct parts. A360242

Fully additive with a(p) = p# for prime p, where x# is the primorial A034386(x). A373158

Sum of the fifth powers of the parts in the partitions of n into two parts. A294272

Triangle read by rows: T(n,k) = A002110(n) + A002110(k), 0 <= k <= n; sums of two primorials, not necessarily distinct. A370121

Numbers k such that (A276086(k)/s)^s < k^s-1, where A276086 is the primorial base exp-function, and s = bigomega(k). A370127

Sum of the odd parts in all partitions of n into distinct parts. A116682

Sums of 2 distinct primorials. A177689

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

Triangle read by rows: T(n,k) = A002110(n) + A002110(k), 1 <= k <= n; sums of two primorials > 1, not necessarily distinct. A370134