Properties of the Number 30302

Thirty Thousand Three Hundred Two

Basics

Value: 30301 → 30302 → 30303

Parity: even

Prime: No

Previous Prime: 30293

Next Prime: 30307

Digit Sum: 8

Digital Root: 8

Palindrome: No

Factorization: 2 × 109 × 139

Divisors: 1, 2, 109, 139, 218, 278, 15151, 30302

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111011001011110

Octal: 73136

Duodecimal: 15652

Hexadecimal: 765e

Square: 918211204

Square Root: 174.07469661039195

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

Expansion of g.f.: ((1 - x - sqrt(1-6·x+5·x²))/(2·x))². A45868

Path-counting array T; each step of a path is (1 right) or (1 up) to a point below line y=x, else (1 right and 1 up) or (1 up) to a point on the line y=x, else (1 left) or (1 up) to a point above line y=x. T(i,j)=number of paths to point (i-j,j), for 1<=j<=i, i >= 1. A55450

Sum array of Catalan numbers (A000108) read by upward antidiagonals. A106534

Number of nonsquare simple imperfect squared rectangles of order n up to symmetry. A220165

Numbers k such that k and k⁶ have no digits in common. A281148

Sequence A014486 shown in base 4. A85185

Triangle A106534 with reversed rows. A280470

a(n) = ∑_k=0..n-2 T(n,k) * T(n,k+2), with T given by A026386. A26953

Triangle of numbers arising in recursive computation of A002212. A73149

Even composite integers m such that A004254(m)² == 1 (mod m). A338314