4656
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
- 2
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 12152
- Proper Divisor Sum (Aliquot Sum)
- 7496
- 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
- 1536
- Möbius Function
- 0
- Radical
- 582
- Omega Function (Ω)
- 6
- 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
- yes
- 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
- 121
- 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
- Coefficients of period polynomials.at n=23A006308
- Coordination sequence T1 for Zeolite Code DOH.at n=42A008078
- a(n) = p*(p-1)/2 for p = prime(n).at n=24A008837
- Binomial coefficients C(n,95).at n=2A017759
- Binomial coefficients C(97,n).at n=2A017813
- a(n) = Sum_{k=0..n} T(n,k) * T(n,2n-k), with T given by A027023.at n=7A027041
- Number of 3-balanced strings of length n: let d(S)= #(1)'s in S - #(0)'s, then S is k-balanced if every substring T has -k<=d(T)<=k; here k=3.at n=15A027557
- Expansion of (theta_3(z)*theta_3(15z) + theta_2(z)*theta_2(15z))^4.at n=17A028628
- a(n) = (prime(n)-3)*(prime(n)-5)/8.at n=43A030007
- a(n) = 2*n*(4*n + 1).at n=24A033585
- a(n) = (n^2-1)*(2*n^2-1).at n=7A033595
- Number of nonnegative solutions of x1^2 + x2^2 + ... + x9^2 = n.at n=18A045851
- Starting from generation 5 add previous and next term yielding generation 6.at n=34A048452
- Values of n such that 90n+11, 90n+13, 90n+17, 90n+19 are all primes.at n=28A051897
- Number of prime Hurwitz quaternions of norm prime(n).at n=43A055669
- Coordination sequence T5 for Zeolite Code SFE.at n=45A057321
- a(n) = binomial(n,0) - binomial(n,2) + binomial(n,4).at n=20A058923
- G.f. is ((1-x)/(1-2*x)) * G(x*(1-x)/(1-2*x)) where G(x) is g.f. for Catalan numbers A000108.at n=7A059279
- a(n) = (prime(n)^2 - 1)/8.at n=42A061066
- Numbers k > 1 such that, in base 3, k and k^2 contain the same digits in the same proportion.at n=40A061657