4193
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 4800
- Proper Divisor Sum (Aliquot Sum)
- 607
- 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
- 3588
- Möbius Function
- 1
- Radical
- 4193
- 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
- 64
- 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 generalized partition function.at n=14A002600
- Define the sequence T(a(0),a(1)) by a(n+2) is the greatest integer such that a(n+2)/a(n+1) < a(n+1)/a(n) for n >= 0. This is T(4,10).at n=8A019494
- Nearest integer to Gamma(n + 1/12)/Gamma(1/12).at n=9A020004
- Ceiling of Gamma(n+1/12)/Gamma(1/12).at n=9A020094
- Numbers k such that k^2 is palindromic in base 4.at n=16A029986
- Partial sums of sequence {1/(i^2+1): i=0..n} (numerators).at n=5A033467
- Write 1,2,... in a clockwise spiral; sequence gives numbers on positive x axis.at n=32A033951
- a(n) = 4^(n+1) + 3*2^n + 1.at n=6A036562
- Partial sums of primes congruent to 5 mod 6.at n=30A038361
- Numbers having three 1's in base 8.at n=39A043427
- Numbers whose base-8 representation has exactly 5 runs.at n=22A043627
- Numbers whose base-4 representation contains exactly three 0's and three 1's.at n=24A045031
- Numbers whose base-5 representation contains exactly two 1's and three 3's.at n=17A045243
- 5-morphic but not bimorphic nor automorphic.at n=49A056033
- 5-morphic but not bimorphic, automorphic nor trimorphic.at n=29A056036
- Numbers k such that k^4 == 1 (mod 5^4).at n=26A056091
- Numbers k such that k^4 == 1 (mod 5^5).at n=5A056102
- Expansion of series related to Liouville's Last Theorem: g.f. sum_{t>0} (-1)^(t+1) *x^(t*(t+1)/2) / ( (1-x^t)^5 *product_{i=1..t} (1-x^i) ).at n=12A059822
- a(n) = 2^n + 3^n + 8^n.at n=4A074530
- 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=20A075252