Properties of the Number 30666

Thirty Thousand Six Hundred Sixty-Six

Basics

Value: 30665 → 30666 → 30667

Parity: even

Prime: No

Previous Prime: 30661

Next Prime: 30671

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 19 × 269

Divisors: 1, 2, 3, 6, 19, 38, 57, 114, 269, 538

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111011111001010

Octal: 73712

Duodecimal: 158B6

Hexadecimal: 77ca

Square: 940403556

Square Root: 175.11710367636852

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

A(n,k) is (1/k) times the number of n-member subsets of [k·n] whose elements sum to a multiple of n; square array A(n,k), n>=1, k>=1, read by antidiagonals. A309148

a(n) = total number of convex equilateral n-gons with corner angles of m*π/n (0 < m <= n). A262181

a(n) = ∑_i=0..n digsum(i)⁴, where digsum(i) = A007953(i). A231689

a(n) = 2·A000538(n). A259108

Number of distinct convex equilateral n-gons having rotational symmetry and with corner angles of m*π/n (0 < m <= n). A292355

Number of ways to place n nonattacking composite pieces queen + rider[1,4] on an n X n chessboard. A189874

(1/3) times the number of n-member subsets of [3n] whose elements sum to a multiple of n. A309182

Number of subsets of 8 integers between 1 and n such that their sum is 0 modulo n. A381291

Numbers k such that 189·2^k+1 is prime. A32471

Numbers k such that k·2^k+(k-1) is prime. A46849