7476
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 20160
- Proper Divisor Sum (Aliquot Sum)
- 12684
- 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
- 2112
- Möbius Function
- 0
- Radical
- 3738
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 88
- 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 1/((1+x)*(1-x)^7).at n=11A001769
- Number of ways in which n identical balls can be distributed among 4 boxes in a row such that each pair of adjacent boxes contains at least 4 balls.at n=27A005337
- Molien series for alternating group Alt_12 (or A_12).at n=33A008635
- Number of partitions of n into at most 12 parts.at n=33A008641
- Number of partitions of n into prime power parts (1 included); number of nonisomorphic Abelian subgroups of symmetric group S_n.at n=36A023893
- Matrix 8th power of partition triangle A008284.at n=38A050302
- Numbers k such that phi(x) = k has exactly 9 solutions.at n=39A060672
- Centered 23-gonal numbers.at n=25A069174
- Least positive integer coefficients of power series A(x) such that the coefficients of A(x)^2 + A(x) - 1 consist entirely of squares.at n=79A083352
- a(n) = n*(n^2 + 2*n - 1)/2.at n=23A127736
- Indices k such that A020503(k)=Phi[k](-4) is prime, where Phi is a cyclotomic polynomial.at n=37A138926
- Indices k such that A019322(k) = Phi[k](4) is prime, where Phi is a cyclotomic polynomial.at n=39A138934
- 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, 0), (-1, 1, -1), (-1, 1, 0), (1, 0, -1), (1, 0, 1)}.at n=8A149152
- a(n) = n*A007504(n)/2 = n*(sum of first n primes)/2.at n=21A156778
- a(n) = 343*n - 70.at n=21A157374
- Triangle of characteristic polynomials, see Mathematica code.at n=25A158391
- Numbers that are multiples of 28 and contain both a 4 and a 7.at n=21A171077
- Triangle T, read by rows : T(n,k) = A007318(n,k)*A005773(n+1-k).at n=38A171651
- Triangle read by rows: T(n,k) is the number of derangements of {1,2,...,n} having genus k (see first comment for definition of genus).at n=37A178514
- Number of nondecreasing strings of numbers x(i=1..6) in -n..n with sum x(i)^3 equal to 0.at n=28A188280