7724
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 13524
- Proper Divisor Sum (Aliquot Sum)
- 5800
- 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
- 3860
- Möbius Function
- 0
- Radical
- 3862
- Omega Function (Ω)
- 3
- 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
- 145
- 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
- Smallest number requiring n Fibonacci numbers to build using + and *.at n=5A025282
- T(n,n+2), array T as in A047060.at n=8A047067
- a(n) = sigma[k](n) - phi(n)^k - d(n)^k for k=3.at n=24A079539
- Number of degeneracies on the sets of n ordinary trees with n vertices. These are the values of the Wiener number, W, in Table 15 of the paper by Elena V. Konstantinova and Maxim V. Vidyuk.at n=8A125081
- 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, 0, -1)}.at n=8A149005
- Dispersion of (2*floor(n*sqrt(3))), by antidiagonals.at n=48A191542
- Number of 2 X 2 matrices having all elements in {-n,...n} and determinant 4.at n=21A209988
- Number of (n+2) X (2+2) 0..2 arrays with every 3 X 3 subblock row and column sum 2 3 or 4 and every diagonal and antidiagonal sum not 2 3 or 4.at n=3A252222
- Number of (n+2) X (4+2) 0..2 arrays with every 3 X 3 subblock row and column sum 2 3 or 4 and every diagonal and antidiagonal sum not 2 3 or 4.at n=1A252224
- T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with every 3X3 subblock row and column sum 2 3 or 4 and every diagonal and antidiagonal sum not 2 3 or 4.at n=11A252228
- T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with every 3X3 subblock row and column sum 2 3 or 4 and every diagonal and antidiagonal sum not 2 3 or 4.at n=13A252228
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 129", based on the 5-celled von Neumann neighborhood.at n=23A270219
- Number of partitions of n containing no part i of multiplicity i-1.at n=34A277102
- Number of nX3 0..1 arrays with every element unequal to 0, 1, 2 or 6 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=10A318338
- Expansion of Product_{i>=1, j>=1, k>=1} (1 - x^(i*j*k)).at n=44A319359
- Number of partitions of n with up to four distinct kinds of 1.at n=28A320691
- Indices of primes followed by a gap (distance to next larger prime) of 42.at n=10A320719
- a(n) = Sum_{ i=2..n-1, j=1..i-1, gcd(i,j)=1 } (n-i)*(n-j).at n=17A332612
- The number of vertices formed on an isosceles triangle by straight line segments mutually connecting all vertices and all points that divide the two equal length sides into n equal parts; the base of the triangle contains no points other than its vertices.at n=13A333026
- Number of integer partitions of n with reverse-alternating product <= 1.at n=35A347443