3845
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 4620
- Proper Divisor Sum (Aliquot Sum)
- 775
- 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
- 3072
- Möbius Function
- 1
- Radical
- 3845
- 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
- 51
- 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
- Coordination sequence T4 for Zeolite Code AFR.at n=47A008022
- Coordination sequence T4 for Zeolite Code VNI.at n=38A009910
- Prefix (or Levenshtein) codes for natural numbers.at n=21A010097
- Smallest odd k>n such that k | n^k + n, or 0 if n=2^m.at n=40A015908
- Nine iterations of Reverse and Add are needed to reach a palindrome.at n=20A015990
- Pseudoprimes to base 62.at n=31A020190
- Strong pseudoprimes to base 62.at n=12A020288
- Number of 3's in all partitions of n.at n=27A024787
- a(n) = least m such that if r and s in {1/4, 1/8, 1/12,..., 1/4n} satisfy r < s, then r < k/m < s for some integer k.at n=35A024825
- a(n) = least m such that if r and s in {1/2, 1/4, 1/6, ..., 1/2n} satisfy r < s, then r < k/m < (k+1)/m < s for some integer k.at n=33A024835
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (odd natural numbers), t = A001950 (upper Wythoff sequence).at n=19A025114
- Sequence satisfies T^2(a)=a, where T is defined below.at n=52A027586
- Number of proper factorizations of p1^n*p2^2, where p1 and p2 are distinct primes.at n=17A031125
- Concatenation of n and n+7.at n=37A032612
- Every run of digits of n in base 4 has length 2.at n=30A033002
- Positive numbers having the same set of digits in base 6 and base 9.at n=21A037436
- Denominators of continued fraction convergents to sqrt(962).at n=2A042861
- Coordination sequence T5 for Zeolite Code DON.at n=42A047957
- Values of n^2 + 1 resulting from A050796.at n=33A050800
- Sum of numbers in range 10*n to 10*n+9.at n=38A053743