4609
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 5040
- Proper Divisor Sum (Aliquot Sum)
- 431
- 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
- 4180
- Möbius Function
- 1
- Radical
- 4609
- Omega Function (Ω)
- 2
- 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
- 46
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- A Fielder sequence: a(n) = a(n-1) + a(n-2) + a(n-4).at n=14A001641
- Cullen numbers: a(n) = n*2^n + 1.at n=9A002064
- Sum of 10 positive 9th powers.at n=9A003399
- Reve's puzzle: number of moves needed to solve the Towers of Hanoi puzzle with 4 pegs and n disks, according to the Frame-Stewart algorithm.at n=46A007664
- Coordination sequence T6 for Zeolite Code MTW.at n=45A008201
- Pisot sequence E(4,13): a(n) = floor( a(n-1)^2/a(n-2) + 1/2 ).at n=6A010900
- Numbers k such that the continued fraction for sqrt(k) has period 98.at n=1A020437
- a(n) = n*(19*n + 1)/2.at n=22A022277
- a(n) = Sum_{k = 1..n} k*floor((n + prime(k))/k).at n=40A024929
- a(n) = (d(n)-r(n))/2, where d = A026066 and r is the periodic sequence with fundamental period (1,0,0,0).at n=26A026067
- Triangle read by rows: square of the lower triangular mean matrix.at n=37A027446
- a(n) = (H(n) - 1)*lcm{1,...,n}, where H(n) is the n-th harmonic number.at n=8A027457
- Numerator of 1/n + 2/(n-1) + 3/(n-2) + ... + (n-1)/2 + n.at n=7A027612
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 46 ones.at n=7A031814
- Sums of distinct powers of 8.at n=25A033045
- Positive numbers having the same set of digits in base 2 and base 8.at n=21A037413
- Sums of 3 distinct powers of 8.at n=7A038485
- Numbers k that divide 6^k + 5^k.at n=7A045595
- Array T by antidiagonals, T(k,n)=(k+1)*n*2^(n-1)+1, n >= 0, k >= 1.at n=56A048472
- Array T read by diagonals, n-th difference of (T(k,n),T(k,n-1),...,T(k,0)) is (k+n)^2, for n=1,2,3,...; k=0,1,2,...at n=36A048505