3701
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 3702
- 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
- 3700
- Möbius Function
- -1
- Radical
- 3701
- 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
- 131
- 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
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 517
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- a(n) = ceiling(1000*log_2(n)).at n=12A004267
- From relations between Siegel theta series.at n=43A006476
- Coordination sequence T1 for Zeolite Code AFO.at n=40A008015
- Coordination sequence T5 for Zeolite Code MFS.at n=38A008177
- a(n) = floor( n*(n-1)*(n-2)/23 ).at n=45A011905
- Numbers k such that the continued fraction for sqrt(k) has period 43.at n=8A020382
- Number of distinct 'failure tables' for a string of length n.at n=10A022543
- Primes that remain prime through 2 iterations of function f(x) = 7x + 6.at n=44A023259
- Primes that remain prime through 2 iterations of function f(x) = 8x + 3.at n=34A023261
- Primes that remain prime through 3 iterations of function f(x) = 2x + 9.at n=11A023276
- Primes that remain prime through 3 iterations of function f(x) = 3x + 10.at n=25A023280
- Primes that remain prime through 4 iterations of function f(x) = 2x + 9.at n=4A023306
- Square root of A030688.at n=36A030689
- Primes p such that Ramanujan function tau(p) is divisible by 13.at n=31A038543
- Numerators of continued fraction convergents to sqrt(463).at n=5A041882
- a(n) = a(1) + a(2) + ... + 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) = a(2) = 1 and a(3) = 4.at n=13A049897
- Discriminants of real quadratic fields with class number 1 and related continued fraction period length of 11.at n=15A050960
- Automorphic primes: p such that p^p ends with the digits of p.at n=30A052228
- Primes p such that x^37 = 2 has no solution mod p.at n=13A059223
- Primes p such that p^7 reversed is also prime.at n=27A059700