Properties of the Number 30350

Thirty Thousand Three Hundred Fifty

Basics

Value: 30349 → 30350 → 30351

Parity: even

Prime: No

Previous Prime: 30347

Next Prime: 30367

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 2 × 5 ² × 607

Divisors: 1, 2, 5, 10, 25, 50, 607, 1214, 3035, 6070

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

603 Try Today's Challenge

Representations

Binary: 111011010001110

Octal: 73216

Duodecimal: 15692

Hexadecimal: 768e

Square: 921122500

Square Root: 174.21251390184347

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) = 1·2*3 + 4·5*6 + 7·8*9 + 10·11·12 + 13·14·15 + 16·17·18 + ... + (up to n). A319014

Total number of zero digits in primes less than 10ⁿ. A231411

Self-convolution equals A183160. A183161

a(n) = coefficient of xⁿ*yⁿ in ∏_n>=1 (1 - (xⁿ + yⁿ)). A322213

For any n > 0, if A006666(n) >= 0, then a(n) = ∑_{i = 0..A006666(n)-1} 2ⁱ * [Tⁱ(n) == 0 (mod 2)] (where [] is an Iverson bracket and Tⁱ denotes the i-th iterate of the Collatz function A014682); otherwise a(n) = -1. A304715

Number of (n+1) X (2+1) 0..1 arrays with nondecreasing x(i,j)+x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction. A250723

Expansion of 1 / (1 + ∑_k>=1 μ(k)² * x^k). A329099

Triangle T(n,m) by rows: The number of tatami tilings of a 3 by n grid with dimers and m monomers. A272472

a(n) = (# 1's)-(# 2's) in first n terms of A030341. A30350