Properties of the Number 30093

Thirty Thousand Ninety-Three

Basics

Value: 30092 → 30093 → 30094

Parity: odd

Prime: No

Previous Prime: 30091

Next Prime: 30097

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 7 × 1433

Divisors: 1, 3, 7, 21, 1433, 4299, 10031, 30093

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111010110001101

Octal: 72615

Duodecimal: 154B9

Hexadecimal: 758d

Square: 905588649

Square Root: 173.4733408913312

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

Number of partitions of n such that the least part occurs at least twice. A117989

Number of ways to split an n-cycle into connected subgraphs all having at least 4 vertices. A306351

Number of partitions of n such that m(greatest part) <= m(1), where m = multiplicity. A240077

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

Intersection of A392605 and A392611. A392606

Number of balanced numbers <= 2ⁿ. A78662

Self-convolution of A092684. A100938

Number of nX5 0..1 arrays with every element equal to 2, 3, 5, 7 or 8 king-move adjacent elements, with upper left element zero. A298927

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

T(n,k)=Number of nXk 0..1 arrays with every element equal to 2, 3, 5, 7 or 8 king-move adjacent elements, with upper left element zero. A298930