Properties of the Number 30691

Thirty Thousand Six Hundred Ninety-One

Basics

Value: 30690 → 30691 → 30692

Parity: odd

Prime: No

Previous Prime: 30689

Next Prime: 30697

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 47 × 653

Divisors: 1, 47, 653, 30691

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111011111100011

Octal: 73743

Duodecimal: 15917

Hexadecimal: 77e3

Square: 941937481

Square Root: 175.18846994023323

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

Binomial transform of [1, 30, 30, 30, ...]. A139700

a(n) = IntegerPart(PolyGamma(n, 3)). A144169

Triangle read by rows: T(n,k) is the number of Grand Dyck paths of semilength n that have k double rises above the x-axis (n >= 1, k >= 0). A118964

Triangle T(n,k), read by rows, defined by T(n,k)=3·T(n-1,k)-T(n-1,k-1)-T(n-2,k), T(0,0)=1, T(1,0)=2, T(1,1)=-1, T(n,k)=0 if k<0 or if k>n. A123971

Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k peak plateaux (0<=k<=floor(n/2)). A peak plateau is a run of consecutive peaks that is preceded by an upstep and followed by a down step; a peak consists of an upstep followed by a downstep. A143952

a(n) = n³ + (1-n)². A168297

Triangle read by rows: T(n,k) is the number of bargraphs of semiperimeter n having k peaks (n >= 2, k >= 1). A271940

Numerators of the partial alternating sums of the reciprocals of the sum of divisors function (A000203). A357845

Constant term in the expansion of (1 + x⁴ + y⁴ + 1/(x·y))ⁿ. A361700

a(n) = ∑_{1 <= x₁, x₂, x₃ <= n} gcd(x₁, x₂, n)/gcd(x₁, x₂, x₃, n). A373061