7776
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 36
- Divisor Sum
- 22932
- Proper Divisor Sum (Aliquot Sum)
- 15156
- 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
- 2592
- Möbius Function
- 0
- Radical
- 6
- Omega Function (Ω)
- 10
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 101
- 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
- yes
- Achilles Number
- no
- Perfect Power
- yes
- Smooth Number
- yes
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Appears in sequences
- Number of primitive polynomials of degree n over GF(2) (version 2).at n=17A000020
- Number of labeled rooted trees with n nodes: n^(n-1).at n=5A000169
- Powers of 6: a(n) = 6^n.at n=5A000400
- a(n) is smallest number > a(n-1) of form a(i)*a(j), i < j < n.at n=44A000423
- Fifth powers: a(n) = n^5.at n=6A000584
- Number of transpositions needed to generate permutations of length n.at n=6A001540
- Square array read by upwards antidiagonals: T(n,k) = n^k for n >= 0, k >= 0.at n=71A003992
- Array read by ascending antidiagonals: A(n, k) = k^n.at n=72A004248
- Numbers that are the sum of at most 2 positive 5th powers.at n=21A004842
- Number of points on surface of truncated cube: a(n) = 46*n^2 + 2 for n > 0.at n=13A005911
- Highly powerful numbers: numbers with record value of the product of the exponents in prime factorization (A005361).at n=17A005934
- Walks on hexagonal lattice using each point at most three times.at n=5A007275
- MU-numbers: next term is uniquely the product of 2 earlier terms.at n=23A007335
- Numbers k such that phi(k) divides k.at n=55A007694
- Triangle read by rows: T(n,k) is the number of partially labeled rooted trees with n vertices, k of which are labeled, 0 <= k <= n.at n=26A008295
- Triangle read by rows: T(n,k) is the number of partially labeled rooted trees with n vertices, k of which are labeled, 0 <= k <= n.at n=27A008295
- a(n) = floor(n/5)*floor((n+1)/5)*floor((n+2)/5)*floor((n+3)/5)*floor((n+4)/5).at n=30A008382
- Expansion of (1-x^6) / (1-x)^6.at n=13A008488
- Coordination sequence for NiAs(1), As position.at n=36A009943
- Triangle in which j-th entry in i-th row is (j+1)^(i-j).at n=60A009998