Properties of the Number 30122

Thirty Thousand One Hundred Twenty-Two

Basics

Value: 30121 → 30122 → 30123

Parity: even

Prime: No

Previous Prime: 30119

Next Prime: 30133

Digit Sum: 8

Digital Root: 8

Palindrome: No

Factorization: 2 × 15061

Divisors: 1, 2, 15061, 30122

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111010110101010

Octal: 72652

Duodecimal: 15522

Hexadecimal: 75aa

Square: 907334884

Square Root: 173.55690709389816

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

Tribonacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) with a(0)=0, a(1)=1, a(2)=0. A1590

Expansion of (1-x)/(1+x-x²+x³). A78042

a(n) = ∑_k=0..n T(n, k), array T as in A047080. A47081

Triangular array read by rows: T(n,k) is the number of set partitions of {1,2,...,n} that have exactly k distinct block sizes. A208437

Define a sequence of real numbers by b(1)=2, b(n+1) = b(n) + log₂(b(n)); a(n) = smallest i such that b(i) >= 2ⁿ. A229168

Number of partitions of n-set with 2 block sizes. A88142

Tribonacci sequences A000073 and A001590 interleaved. A213816

Taylor series related to one in Ramanujan's Lost Notebook. A6305

Number of n X 2 0..3 arrays x(i,j) with each element horizontally or vertically next to at least one element with value (x(i,j)+1) mod 4, no adjacent elements equal, and upper left element zero. A231057

"Inside numbers". Pick a term "t" and one of its digits "d". Now jump to the right over d digits if "d" is odd, and to the left over d digits if "d" is even. Whatever the "d" you choose, you will stay on "t". A284515