3851
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
- 2
- Divisor Sum
- 3852
- Proper Divisor Sum (Aliquot Sum)
- 1
- 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
- 3850
- Möbius Function
- -1
- Radical
- 3851
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 144
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- yes
- Mersenne Prime
- no
- Sophie Germain Prime
- yes
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 534
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Artiads: the primes p == 1 (mod 5) for which Fibonacci((p-1)/5) is divisible by p.at n=19A001583
- Smallest prime p==3 (mod 8) such that Q(sqrt(-p)) has class number 2n+1.at n=12A002148
- Largest prime factor of 3^(2n+1) - 1.at n=5A002591
- Prefix (or Levenshtein) codes for natural numbers.at n=27A010097
- Super-3 Numbers (3n^3 contains substring '333' in its decimal expansion).at n=32A014569
- Numbers k such that the continued fraction for sqrt(k) has period 70.at n=8A020409
- Primes that remain prime through 2 iterations of function f(x) = 8x + 1.at n=14A023260
- a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n+1-k), where k = [ (n+1)/2 ], s = (1, p(1), p(2), ...).at n=19A024479
- a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = [ n/2 ], s = (1, p(1), p(2), ...).at n=18A025099
- Primes that are palindromic in base 7.at n=14A029975
- 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 61.at n=10A031559
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 30 ones.at n=23A031798
- The 20 primes inside the 4 X 4 matrix with all the rows, columns and major diagonals being reversible non-palindromic and distinct primes (the smallest prime-magical square): [ 1933, 1283, 9551, 3719 ].at n=11A032530
- Numbers whose set of base-7 digits is {1,4}.at n=40A032819
- Numbers in which all pairs of consecutive base-7 digits differ by 3.at n=31A033078
- Primes of the form x^2+74*y^2.at n=26A033248
- Number of partitions of n with equal number of parts congruent to each of 2 and 3 (mod 4).at n=38A035545
- Number of partitions of n into parts 4k+1 and 4k+3 with at least one part of each type.at n=50A035625
- Coordination sequence T4 for Zeolite Code AFN.at n=44A038404
- Primes of form abs(2*n^2-199).at n=41A039950