7329
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 11200
- Proper Divisor Sum (Aliquot Sum)
- 3871
- 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
- 4176
- Möbius Function
- -1
- Radical
- 7329
- Omega Function (Ω)
- 3
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 101
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- no
- Odd
- yes
Appears in sequences
- Numbers that are the sum of 9 positive 7th powers.at n=33A003376
- Numbers that are the sum of 4 nonzero 8th powers.at n=8A003382
- Numbers that are the sum of at most 4 nonzero 8th powers.at n=24A004877
- Numbers that are the sum of at most 5 nonzero 8th powers.at n=33A004878
- a(n) = Sum_{k=1..n} k*[ (n/k)*[ (n/k)*[ n/k ] ] ].at n=16A024933
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 56.at n=30A031554
- a(n) = Sum_{k=1..n} Sum_{j=1..k} (prime(k) - prime(j))^2.at n=9A062022
- Integers n > 7059 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 7059.at n=2A063058
- Numbers k such that the digits of k joined to the digits of 2k contain each of the digits from 1 to 9 once.at n=5A064160
- Coefficients of the B-Rogers mod 14 identity.at n=36A105781
- Apocalypse primes: 10^665+a(n) has 666 decimal digits and is prime.at n=3A115983
- Central terms of triangle A124328; a(n) = A124328(2n+1,n+1) for n>=0.at n=6A124889
- 1+5*n+7*n^2.at n=31A168235
- Coefficients of expansion polynomial:p(x,t)=Exp[ -t^2* x](1 - t)^(-x)/x.at n=40A174893
- Numbers n such that 10^(2n+1) + 21*10^n + 1 is prime.at n=12A212129
- G.f.: Sum_{n>=0} a(n)*x^n / (1+x)^(n^3) = x.at n=4A229711
- Number of (n+1) X (1+1) 0..2 arrays with the minimum plus the upper median equal to the lower median plus the maximum in every 2 X 2 subblock.at n=6A235877
- Number of (n+1) X (7+1) 0..2 arrays with the minimum plus the upper median equal to the lower median plus the maximum in every 2 X 2 subblock.at n=0A235883
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the minimum plus the upper median equal to the lower median plus the maximum in every 2X2 subblock.at n=21A235884
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the minimum plus the upper median equal to the lower median plus the maximum in every 2X2 subblock.at n=27A235884