4604
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 8064
- Proper Divisor Sum (Aliquot Sum)
- 3460
- 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
- 2300
- Möbius Function
- 0
- Radical
- 2302
- 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
- yes
- 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 partitions of floor(5n/2) into n nonnegative integers each no more than 5.at n=28A001975
- Absolute value of Glaisher's alpha(n).at n=29A002290
- Numbers k where |cos(k)| (or |cosec(k)| or |cot(k)|) decreases monotonically to 0; also numbers k where |tan(k)| (or |sec(k)|, or |sin(k)|) increases.at n=18A004112
- Coordination sequence T5 for Zeolite Code AET.at n=47A008011
- Coordination sequence T3 for Zeolite Code VET.at n=41A009904
- Number of ordered quadruples of integers from [ 2,n ] with no common factors between triples.at n=19A015639
- Numbers k such that the continued fraction for sqrt(k) has period 44.at n=37A020383
- Least k such that tan(k) > tan(a(n-1)), for n >= 1, where a(0) = 0.at n=29A024814
- Number of n-celled polyknights with bilateral symmetry.at n=9A030447
- Sin(n) decreases monotonically to -1.at n=11A046964
- Row sums of A051598.at n=10A053209
- 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=42A054098
- T(n,n-2), array T as in A054098.at n=6A054102
- Number of ways of placing n nonattacking (normal) queens on n X n board; solutions congruent on the torus count only once.at n=12A062164
- Numbers k such that floor(tan(k)) > floor(tan(m)) for all m < k.at n=26A063537
- Let u be any string of n digits from {0,...,8}; let f(u) = number of distinct primes, not beginning with 0, formed by permuting the digits of u to a base-9 number; then a(n) = max_u f(u).at n=7A065850
- Smallest number k such that n! - k is a square.at n=11A066857
- Triangle of numbers {a(n,k), n >= 0, 0<=k<=n} defined by a(0,0)=1, a(n,0)=A006013(n), a(n+1,n)=A001764(n+1), a(n,m) = Sum A001764(n-k)*a(n,k), k=0..m.at n=22A073148
- Least k > n such that p(n) divides p(k), where p(k) denotes the k-th partition number (A000041).at n=33A079031
- a(0)=1; a(n) is the smallest integer > a(n-1) such that sin(a(n)) is closer to an integer (here 0 or -1) than sin(a(n-1)).at n=10A079037