6762
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 16416
- Proper Divisor Sum (Aliquot Sum)
- 9654
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 1848
- Möbius Function
- 0
- Radical
- 966
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 44
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Appears in sequences
- a(n) = round(n*phi^12), where phi is the golden ratio, A001622.at n=21A004947
- a(n) = ceiling(n*phi^12), where phi is the golden ratio, A001622.at n=21A004967
- Numbers of Twopins positions.at n=21A005688
- Number of points on surface of cuboctahedron (or icosahedron): a(0) = 1; for n > 0, a(n) = 10n^2 + 2. Also coordination sequence for f.c.c. or A_3 or D_3 lattice.at n=26A005901
- a(n) = Fibonacci(n) - 3. Number of total preorders.at n=16A006327
- a(0) = 1, a(n) = 40*n^2 + 2 for n>0.at n=13A010022
- Numbers with exactly five distinct base-9 digits.at n=5A031986
- Integers n > 879 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 879.at n=34A063052
- Number of rational knots of n crossings with signature 0 (chiral pairs counted twice).at n=16A078478
- a(n) = Fibonacci(4n)-3, or Fibonacci(2n-2)*Lucas(2n+2).at n=4A081074
- a(n) = (n+1)*(n+2)^2*(n+3)*(n+4)*(5*n^2 + 18*n + 15)/720.at n=5A107962
- Number of compositions of n into odd and relatively prime parts.at n=19A108700
- Average of twin-prime pairs for pairs that are expressible as the sum of two triangular numbers.at n=16A117313
- Multiples of 7, k, such that k +/- 1 are twin primes.at n=28A127545
- Numbers k such that k and k^2 use only the digits 2, 4, 5, 6 and 7.at n=31A137094
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 1), (0, 1, 1), (1, -1, -1), (1, 1, -1)}.at n=8A148892
- Averages of twin prime pairs which are a sum of averages of two consecutive twin prime pairs.at n=20A160916
- Triangle related to the o.g.f.s. of the right hand columns of A163934 (E(x,m=4,n)).at n=12A163939
- Let S be the sequence Fibonacci(2n), n>0 (cf. A001906); sequence lists the differences S(j)-S(i) for i<j.at n=43A169690
- 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.at n=61A186761