Properties of the Number 30140

Thirty Thousand One Hundred Forty

Basics

Value: 30139 → 30140 → 30141

Parity: even

Prime: No

Previous Prime: 30139

Next Prime: 30161

Digit Sum: 8

Digital Root: 8

Palindrome: No

Factorization: 2 ² × 5 × 11 × 137

Divisors: 1, 2, 4, 5, 10, 11, 20, 22, 44, 55

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111010110111100

Octal: 72674

Duodecimal: 15538

Hexadecimal: 75bc

Square: 908419600

Square Root: 173.60875553957524

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

Number of 10's in all partitions of n. A24794

a(n) = number of 9-digit primes with digit sum n, where n runs through the non-multiples of 3 in the range [2..80]. A178884

G.f. A(x) satisfies A(x/A(x)²) = 1/(1-x)². A145163

a(n) = A120963(n)/2. A341710

a(n) = A120963(2·n)/2. A341712

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 185", based on the 5-celled von Neumann neighborhood. A270636

a(1) = 1; a(n+1) = ∑_d∣n σ(n/d)*a(d), where σ = sum of divisors (A000203). A307817

θ series of A₁₀ lattice. A8450

θ series of A*_10 lattice. A23922

a(n) = a(n-2) + a(n-3) for n >= 3, with a(0) = a(1) = 2, a(2) = 1. A276477