3839
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 4200
- Proper Divisor Sum (Aliquot Sum)
- 361
- 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
- 3480
- Möbius Function
- 1
- Radical
- 3839
- 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
- 113
- 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) = n concatenated with n + 1.at n=37A001704
- Number of achiral rooted trees.at n=20A003241
- Coordination sequence T3 for Zeolite Code -PAR.at n=44A009857
- Number of subsets of { 1, ..., n } containing an A.P. of length 7.at n=16A018792
- Numbers k such that Fibonacci(k) == 89 (mod k).at n=42A023182
- a(n) = [ Sum{(sqrt(j+1)-sqrt(i+1))^2} ], 1 <= i < j <= n.at n=41A025222
- Pair up the numbers.at n=19A030656
- Trajectory of 3 under map n->29n+1 if n odd, n->n/2 if n even.at n=19A037112
- Coordination sequence T16 for Zeolite Code STT.at n=41A038425
- Sums of 11 distinct powers of 2.at n=3A038462
- Numbers having three 7's in base 8.at n=10A043451
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 3, and a(3) = 2.at n=38A050061
- Number of objects generated by the Combstruct grammar defined in the Maple program. See the link for the grammar specification.at n=8A052815
- Comparisons needed for Batcher's sorting algorithm applied to 2^n items.at n=8A053545
- Composite numbers k for which phi(k) + sigma(k) is an integer multiple of the 4th power of the number of divisors of k.at n=15A055468
- Number of primitive (aperiodic) palindromic structures using a maximum of five different symbols.at n=15A056479
- Number of primitive (period n) periodic palindromic structures using a maximum of five different symbols.at n=15A056516
- Sum of n-th row of triangle of primes: 2; 2 3 2; 2 3 5 3 2; 2 3 5 7 5 3 2; ...; where n-th row contains 2n+1 terms.at n=32A061802
- Semiprimes p1*p2 such that p2 > p1 and p2 mod p1 = 8.at n=20A064906
- Numbers that in base 2 need twelve 'Reverse and Add' steps to reach a palindrome.at n=24A066133