Properties of the Number 30594

Thirty Thousand Five Hundred Ninety-Four

Basics

Value: 30593 → 30594 → 30595

Parity: even

Prime: No

Previous Prime: 30593

Next Prime: 30631

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 5099

Divisors: 1, 2, 3, 6, 5099, 10198, 15297, 30594

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111011110000010

Octal: 73602

Duodecimal: 15856

Hexadecimal: 7782

Square: 935992836

Square Root: 174.91140614608298

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

Smallest of first string of exactly 2n-1 consecutive composite integers. A45881

Numbers m > 3 such that x^m + x³ + 1 is irreducible over GF(2) while x^m + x³ + x² + x + 1 = x^m + (x + 1)³ is not. A344177

Numbers k such that x^k + x³ + 1 is irreducible over GF(2). A57461

Irregular table read by rows: T(n,k) is the number of k-gons, k>=2, among all distinct circles that can be constructed from the 3 vertices and the equally spaced 3·n points placed on the sides of an equilateral triangle when every pair of the 3 + 3·n points are connected by a circle and where the points lie at the ends of the circle's diameter. A372734

Number of 2Xn 0..3 arrays with no element equal to one plus the sum of elements to its left or one plus the sum of the elements above it or one plus the sum of the elements diagonally to its northwest or zero plus the sum of the elements antidiagonally to its northeast, modulo 4. A240154

a(n) is the smallest positive integer that begins a run of exactly 2·n-1 consecutive integers having at least 4 divisors each. A340735

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), (0, -1, 1), (0, 1, 0), (1, -1, -1)}. A148030

Least number k such that kⁿ +- k +- 1 is prime for all four possibilities, or 0 if no such k exists. A248031

Position of n-th 5 in A030588. A30594