4964
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 9324
- Proper Divisor Sum (Aliquot Sum)
- 4360
- 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
- 2304
- Möbius Function
- 0
- Radical
- 2482
- Omega Function (Ω)
- 4
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 41
- 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
- Number of binary partitions: number of partitions of 2n into powers of 2.at n=42A000123
- Coordination sequence T1 for Zeolite Code ATV.at n=45A008043
- Coordination sequence T1 for Zeolite Code LOV.at n=47A008134
- Number of (undirected) Hamiltonian paths in n-Moebius ladder.at n=17A020875
- Consider the trajectory of n under the iteration of a map which sends x to 3x - sigma(x) if this is >= 0; otherwise the iteration stops. The sequence gives values of n which eventually reach 0.at n=6A037159
- Theta series of D8 lattice with respect to midpoint of edge.at n=8A045820
- Triangle T(n,k), 0<=k<=n, formed from coefficients when formula for n-th diagonal of triangle in A059718 is written as a sum of binomial coefficients.at n=30A059720
- Second diagonal of A059720.at n=5A059724
- Number of ways to place 3 nonattacking queens on a 3 X n board.at n=20A061989
- Dimension of the space of weight n cuspidal newforms for Gamma_1( 81 ).at n=26A063354
- Solution to the Dancing School Problem with 3 girls and n+3 boys: f(3,n).at n=17A079908
- a(n) = 17*a(n-1) + a(n-2), starting with a(0) = 2 and a(1) = 17.at n=3A090306
- a(n+3) = 6a(n+2) - 10a(n+1) + 3a(n); a(0) = 1, a(1) = 4, a(2) = 14.at n=7A104487
- 4-almost primes with semiprime digits (digits 4, 6, 9 only).at n=11A111496
- Inverse Moebius transform of the shifted tetrahedral numbers.at n=28A116963
- Maximum cycle size in range [A014137(n-1)..A014138(n-1)] of permutation A120705/A120706.at n=12A120708
- a(n) = A130179(n)/81.at n=11A130085
- a(n) = A000123( A000975(n-1) ) for n>=1 with a(0)=1, where A000123(n) = number of partitions of 2n into powers of 2 and A000975(n) = n-th number without consecutive equal binary digits.at n=7A132880
- a(0) = 1; for n>0, a(n) = number of binary partitions of the Catalan number A000108(n).at n=5A134040
- Integers k such that 10^k+37 is a prime number.at n=20A135109