Properties of the Number 30201

Thirty Thousand Two Hundred One

Basics

Value: 30200 → 30201 → 30202

Parity: odd

Prime: No

Previous Prime: 30197

Next Prime: 30203

Digit Sum: 6

Digital Root: 6

Palindrome: No

Factorization: 3 × 10067

Divisors: 1, 3, 10067, 30201

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111010111111001

Octal: 72771

Duodecimal: 15589

Hexadecimal: 75f9

Square: 912100401

Square Root: 173.78434912269861

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

E.g.f. satisfies: A(x) = exp( x * (1 + A(x)⁴)/2 ). A349715

Numbers k such that 149·2^k+1 is prime. A32424

T(n,k) is the k-th partition of n in graded reverse lexicographic ordering (A080577) encoded as concatenation of parts which are represented in (zeroless) bijective base-9 numeration (A052382) and separated by zeros; triangle T(n,k), n >= 0, 1 <= k <= A000041(n), read by rows. A332567

Numbers k such that 455·2^k+1 is prime. A323197

Expansion of η(q³)*η(q²¹). A30201

Factorial base representation of n is aerated (and then converted back to decimal): for n = ∑_i=1.. digit(i)*i! (with each digit(i) <= i), a(n) = ∑_i=1.. digit(i)*(2i-1)!. A276089

Left inverse of A276089: For n = ∑_i=1.. d(i)*i! (with each d(i) <= i), a(n) = ∑_j=1.. d(2j-1)*j!. A276090

Primes p with p-1, p+1, prime(p)-1 and prime(p)+1 all practical. A257924