6178
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 9270
- Proper Divisor Sum (Aliquot Sum)
- 3092
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3088
- Möbius Function
- 1
- Radical
- 6178
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 36
- Smith Number
- yes
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- 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
- Convolution of A000203 with itself.at n=23A000385
- Number of complementary pairs of graphs on n nodes. Also number of unlabeled graphs with n nodes and an even number of edges.at n=7A007869
- Number of partitions of n with equal nonzero number of parts congruent to each of 2, 3 and 4 (mod 5).at n=52A035591
- Number of partitions satisfying cn(2,5) <= cn(1,5) + cn(4,5) and cn(3,5) <= cn(1,5) + cn(4,5).at n=31A039891
- Numbers whose base-4 representation contains exactly three 0's and three 2's.at n=21A045055
- Number of pure 2-complexes on 7 unlabeled nodes with n multiple 2-simplexes.at n=7A050912
- Cumulative boustrophedon transform of 1, 0, 0, 0, ...at n=6A059429
- Triangle formed when cumulative boustrophedon transform is applied to 1, 0, 0, 0, ..., read by rows from left to right.at n=29A059431
- Triangle formed when cumulative boustrophedon transform is applied to 1, 0, 0, 0, ..., read by rows from left to right.at n=21A059431
- Triangle formed when cumulative boustrophedon transform is applied to 1, 0, 0, 0, ..., read by rows in natural order.at n=27A059432
- Triangle formed when cumulative boustrophedon transform is applied to 1, 0, 0, 0, ..., read by rows in natural order.at n=29A059432
- Triangle read by rows: T(n,k) = (1/k) times the number of functions from an n-element set into but not onto a k-element set.at n=31A101031
- a(n) = 3*3^n - 3*2^n + 1.at n=6A126644
- Numbers k whose representation can be split in two parts which can be used as seeds for a Fibonacci-like sequence containing k itself.at n=41A130792
- Number of unlabeled graphs with n nodes and an even sum of nodes and edges.at n=7A137858
- Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0) and consisting of n steps taken from {(-1, 0), (0, -1), (0, 1), (1, -1), (1, 0)}.at n=7A151295
- a(n) = 25*n^2 - 14*n + 2.at n=16A154357
- Triangle T(n, k) = Sum_{j=0..k-1} (-1)^j*binomial(k, j+1)*(k-j)^(n-k), read by rows.at n=47A158198
- The number of trisubstitution products with composition C_n H_(2n-1) X_2 Y.at n=14A159940
- Number of binary strings of length n with no substrings equal to 0001 1010 or 1101.at n=14A164488