4606
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 8208
- Proper Divisor Sum (Aliquot Sum)
- 3602
- 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
- 1932
- Möbius Function
- 0
- Radical
- 658
- 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
- 59
- 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 Twopins positions.at n=20A005690
- Expansion of (1+x^2)(1+x^4)/((1-x)^2*(1-x^2)*(1-x^3)).at n=34A007979
- Coordination sequence T3 for Zeolite Code LTN.at n=47A008142
- a(n) = floor(n*(n-1)*(n-2)/24).at n=49A011842
- a(n) = Sum_{k=0..n-2} T(n,k) * T(n,k+2), with T given by A026692.at n=5A026993
- Numbers having period-4 6-digitized sequences.at n=16A031197
- Period of n-countdown club-passing juggling pattern.at n=46A039720
- E.g.f. is series reversion of log(1+x)*(1-x).at n=5A052892
- Triangular array generated by its row sums: T(n,0)=1 for n >= 0, T(1,1)=2, T(n,k)=T(n,k-1)+d*r(n-k) for k=2,3,...,n, d=(-1)^(k+1), n >= 2, r(h)=sum of the numbers in row h of T.at n=44A054098
- T(n,n), array T as in A054098.at n=8A054100
- Number of nonnegative integer 3 X 3 matrices with no zero rows or columns and with sum of elements equal to n, up to row and column permutation.at n=10A054975
- Product of all distinct numbers formed by permuting digits of n.at n=48A061147
- Exponent values m resulting from A061155.at n=44A061156
- a(n) = n times R(n) where R(n) (A004086) is the digit reversal of n.at n=49A061205
- Product of all numbers formed by permuting the digits of n.at n=49A061378
- Product of the k numbers formed by cyclically permuting digits of n (where k = number of digits of n).at n=49A062003
- a(n) = lcm(n, R(n)), where R(n) (A004086) = digit reversal of n.at n=48A068634
- a(n) = lcm(n, R(n)) / gcd(n, R(n)), where R(n) (A004086) is the digit reversal of n.at n=48A070246
- Nonsquares which are the product of two numbers with the same digits (leading zeros are forbidden).at n=27A072443
- Smallest k such that gcd(c(k),k) = gcd(A002808(k),k) = A064814(k) = n.at n=46A073257