Properties of the Number 30909

Thirty Thousand Nine Hundred Nine

Basics

Value: 30908 → 30909 → 30910

Parity: odd

Prime: No

Previous Prime: 30893

Next Prime: 30911

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 10303

Divisors: 1, 3, 10303, 30909

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111100010111101

Octal: 74275

Duodecimal: 15A79

Hexadecimal: 78bd

Square: 955366281

Square Root: 175.8095560542714

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) = Smallest nontrivial number k > 9 such that |first (leftmost) decimal digit of k - second digit + third digit - fourth digit ...| = n. A60982

Smallest number m such that first digit - second digit + third digit - fourth digit ... (of m) = n. A61479

a(n) = Smallest nontrivial number k > 9 such that first (leftmost) digit - second digit + third digit - fourth digit ... of k = n. A61882

Expansion of 1/(1 - x² - x³/(1 - x⁵ - x⁷/(1 - x¹¹ - x¹³/(1 - ... - x^prime(2·k)/(1 - x^prime(2·k+1) - ...))))), a continued fraction. A292802

Number of (n+1) X (5+1) 0..2 arrays with the minimum plus the upper median equal to the lower median plus the maximum in every 2 X 2 subblock. A235881

Number of (n+1) X (7+1) 0..2 arrays with the minimum plus the upper median equal to the lower median plus the maximum in every 2 X 2 subblock. A235883

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the minimum plus the upper median equal to the lower median plus the maximum in every 2X2 subblock. A235884

[ exp(13/15)*n! ]. A30909