6692
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 13440
- Proper Divisor Sum (Aliquot Sum)
- 6748
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 2856
- Möbius Function
- 0
- Radical
- 3346
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 3
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
- no
- Narcissistic Number
- no
- Collatz Steps
- 93
- 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
- Expansion of (Product_{j>=1} (1-(-x)^j) - 1)^8 in powers of x.at n=38A001486
- Number of 3-connected nets with n edges.at n=13A002880
- Numbers that are the sum of 7 positive 7th powers.at n=22A003374
- Number of labeled Greg trees.at n=6A005263
- Number of lines through exactly 6 points of an n X n grid of points.at n=46A018813
- Numbers n such that there are equal numbers of 0's and 1's in first n digits of binary representation of Pi.at n=37A039624
- Numbers whose base-5 representation contains exactly three 2's and two 3's.at n=24A045276
- Triangular array T: put T(n,0)=n+1 for all n >= 0 and all other T(n,k)=0; then put T(n,k)=Sum{T(i,j): 0<=j<=i-n+k, n-k<=i<=n}.at n=51A053199
- Dimension of the space of weight n cuspidal newforms for Gamma_1( 81 ).at n=35A063354
- Numbers k such that phi(k) divides sigma(k+1) + sigma(k).at n=43A067246
- a(n) = Sum_{k=0..floor(n/2)} C(n-k,k+2)*2^(n-k-2)*(1/2)^k.at n=9A099625
- a(n) = 3 + 7*a(n-2) + sqrt(1 + 48*a(n-2) + 48*a(n-2)^2), with a(1) = 0, a(2) = 0, a(3) = 2.at n=8A103625
- Positions where A109890(n) = Sum_{i = 1..n-1} A109890(i).at n=21A111315
- Egyptian fraction representation for the cube root of 42.at n=3A132517
- 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), (0, 1, 1), (1, 1, -1)}.at n=8A148908
- Index sequence to A089840: positions of bijections that preserve A127302 (the non-oriented form of binary trees) and whose behavior does not depend on whether there are internal or terminal nodes (leaves) in the neighborhood of any vertex.at n=36A153830
- Positions of records in A165601.at n=46A166045
- Number of distinct solutions of sum{i=1..2}(x(2i-1)*x(2i)) = 1 (mod n), with x() in 0..n-1.at n=36A180804
- Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k up-down cycles (0<=k<=n). A cycle (b(1), b(2), ...) is said to be up-down if, when written with its smallest element in the first position, it satisfies b(1)<b(2)>b(3)<... .at n=39A186358
- Triangle read by rows: T(n,k) is the number of inversions in k-compositions of n for n >= 3, 2 <= k <= n-1.at n=61A189073