Properties of the Number 6930

Six Thousand Nine Hundred Thirty

Basics

Value: 6929 → 6930 → 6931

Parity: even

Prime: No

Previous Prime: 6917

Next Prime: 6947

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ² × 5 × 7 × 11

Divisors: 1, 2, 3, 5, 6, 7, 9, 10, 11, 14

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 1101100010010

Octal: 15422

Duodecimal: 4016

Hexadecimal: 1b12

Square: 48024900

Square Root: 83.24662155306964

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

Square pyramidal numbers: a(n) = 0² + 1² + 2² + ... + n² = n*(n+1)*(2·n+1)/6. A330

a(n)² is a triangular number: a(n) = 6·a(n-1) - a(n-2) with a(0)=0, a(1)=1. A1109

Sum of all parts of all partitions of n. A66186

10-gonal (or decagonal) numbers: a(n) = n*(4·n-3). A1107

Prime factorization representation of Stern polynomials: a(0) = 1, a(1) = 2, a(2n) = A003961(a(n)), a(2n+1) = a(n)*a(n+1). A260443

a(n) = binomial(n+3, 3)/4 for odd n, n*(n+2)*(n+4)/24 for even n. A6918

Pentanacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) + a(n-4) + a(n-5), a(0)=a(1)=a(2)=a(3)=0, a(4)=1. A1591

a(1)=1, a(2)=2; thereafter, a(n) is the smallest number m not yet in the sequence such that every prime that divides a(n-1) also divides m. A60735

Triangle of Bessel numbers read by rows: T(n,k) is the number of k-matchings of the complete graph K(n). A100861

Triangle of coefficients of Bessel polynomials (exponents in decreasing order). A1497