4633
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
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 4788
- Proper Divisor Sum (Aliquot Sum)
- 155
- 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
- 4480
- Möbius Function
- 1
- Radical
- 4633
- 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
- 108
- 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(n) = a(n-2) + a(n-5).at n=46A001687
- Numbers that are the sum of 7 positive 7th powers.at n=17A003374
- a(n) = floor(n*(n-1)*(n-2)*(n-3)/31).at n=21A011941
- Add 1, multiply by 1, add 2, multiply by 2, etc., start with 1.at n=13A019463
- Pseudoprimes to base 44.at n=34A020172
- Strong pseudoprimes to base 44.at n=11A020270
- Numerators of continued fraction convergents to sqrt(634).at n=6A042216
- Denominators of continued fraction convergents to sqrt(863).at n=9A042667
- a(n) = A048141(3*n+2).at n=45A051060
- Composite numbers k such that sigma(k + 6!) = sigma(k + 720) = sigma(k) + 720.at n=39A054984
- Difference between (smallest square strictly greater than 2^n) and 2^n.at n=31A056008
- Numbers k such that k^12 == 1 (mod 13^3).at n=25A056086
- Smallest semiprime p*q such that q >= p and q mod p = n.at n=31A064910
- a(n) = 6*binomial(n,4) + 5*binomial(n,2) - 4*n + 5.at n=12A066455
- Upper bound on number of regular triangulations of cyclic polytope C(n, n-4).at n=24A066456
- Sum of the remainders when n^2 is divided by squares less than n.at n=33A067459
- Iccanartet sequence: a(n)=R[a(n-1)]+R[a(n-2)]+R[a(n-3)]+R[a(n-4)] where a(1)=a(2)=a(3)=a(4)=1 and R(n) (A004086) is the reverse of n.at n=11A074862
- Trajectory of n under the Reverse and Add! operation carried out in base 2 does not reach a palindrome and (presumably) does not join the trajectory of any term m < n.at n=25A075252
- Number of positions that are exactly n moves from the starting position in the Hockey Puck puzzle.at n=17A079735
- a(n) = smallest k such that the base-2 Reverse and Add! trajectory of A075252(n) joins the trajectory of k.at n=25A092211