Properties of the Number 6762

Six Thousand Seven Hundred Sixty-Two

Basics

Value: 6761 → 6762 → 6763

Parity: even

Prime: No

Previous Prime: 6761

Next Prime: 6763

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 7 ² × 23

Divisors: 1, 2, 3, 6, 7, 14, 21, 23, 42, 46

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1101001101010

Octal: 15152

Duodecimal: 3AB6

Hexadecimal: 1a6a

Square: 45724644

Square Root: 82.23138087129512

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 points on surface of cuboctahedron (or icosahedron): a(0) = 1; for n > 0, a(n) = 10n² + 2. Also coordination sequence for f.c.c. or A₃ or D₃ lattice. A5901

a(n) = Fibonacci(n) - 3. Number of total preorders. A6327

Irregular triangle read by rows where T(n,k) is the number of integer compositions of n with k excedances (parts above the diagonal), all zeros removed. A352524

Integers that are Rhonda numbers to base 30. A255736

Number T(n,k) of permutations of [n] with k ordered cycles such that equal-sized cycles are ordered with increasing least elements; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A285849

Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k increasing odd cycles (0<=k<=n). A cycle (b(1), b(2), ...) is said to be increasing if, when written with its smallest element in the first position, it satisfies b(1)<b(2)<b(3)<... . A cycle is said to be odd if it has an odd number of entries. For example, the permutation (152)(347)(6)(8) has 3 increasing odd cycles. A186761

Numbers n such that the decimal expansions of both n and n² have 2 as smallest digit and 7 as largest digit. A257123

Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths ending at each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 2, n >= 2. A214119

T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the maximum plus the upper median plus the minimum of every 2X2 subblock equal. A236911

Numbers n such that N = n³ is a twin rank (A002822: 6N +- 1 are twin primes). A326234