4659
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 6216
- Proper Divisor Sum (Aliquot Sum)
- 1557
- 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
- 3104
- Möbius Function
- 1
- Radical
- 4659
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 152
- 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
- Numbers k such that the continued fraction for sqrt(k) has period 50.at n=25A020389
- a(n) = least m such that if r and s in {1/1, 1/2, 1/3, ..., 1/n} satisfy r < s, then r < k/m < (k+3)/m < s for some integer k.at n=35A024843
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 67.at n=16A031565
- Numbers k such that 227*2^k+1 is prime.at n=9A032490
- Numbers having four 3's in base 6.at n=11A043384
- Becomes prime or 4 after exactly 9 iterations of f(x) = sum of prime factors of x.at n=0A048131
- Least number which becomes prime or 4 after exactly n iterations of f(x) = sum of prime factors of x.at n=9A048133
- Partial sums of the sequence (A001097) of twin primes.at n=36A048598
- a(n) = Sum_{i=0..2n} (-1)^i * T(i,2n-i), array T as in A049723.at n=27A049725
- a(n) = 4*n^2 - 7*n + 4.at n=34A054567
- Partial sums of sequence of odd primes (A065091); a(n) = sum of the first n odd primes.at n=46A071148
- Semiprimes in A054567.at n=14A113692
- Number of imprimitive (periodic) 2n-bead black-white complementable necklaces with n black beads.at n=20A115122
- Number of partitions of n in which each part, with the possible exception of the largest, occurs at least twice.at n=38A116931
- Smallest k such that A002217(k)=n.at n=9A121360
- Numbers k such that 2*k+1, 4*k+1 and 8*k+1 are primes.at n=41A124041
- Sum of first n primes minus next prime.at n=48A166448
- Number of lobsters with n nodes that are not caterpillars.at n=12A186308
- Number of rhombuses on a (n+1) X 6 grid.at n=40A190094
- a(n) = (7*11^n+1)/2.at n=3A199757