3697
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 3698
- 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
- 3696
- Möbius Function
- -1
- Radical
- 3697
- 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
- 38
- 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
- 516
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Quartan primes: primes of the form x^4 + y^4, x > 0, y > 0.at n=10A002645
- Number of partitions of n into Fibonacci parts (with a single type of 1).at n=50A003107
- Numbers that are the sum of 2 positive 4th powers.at n=26A003336
- Numbers that are the sum of at most 2 nonzero 4th powers.at n=34A004831
- Coordination sequence T3 for Zeolite Code CAS.at n=37A008065
- 4-dimensional centered cube numbers.at n=6A008514
- 3 and -3 are both 4th powers (one implies other) mod these primes p=1 mod 8.at n=23A014755
- Numbers k such that the continued fraction for sqrt(k) has period 81.at n=1A020420
- Primes that remain prime through 2 iterations of the function f(x) = 8*x + 5.at n=27A023262
- Least m such that if r and s in {1/4, 1/8, 1/12, ..., 1/4n} satisfy r < s, then r < k/m < (k+1)/m < s for some integer k.at n=23A024839
- Primes that are palindromic in base 7.at n=13A029975
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 40 ones.at n=10A031808
- Number of ways to partition n elements into pie slices of different odd sizes.at n=54A032154
- a(i) is a square mod a(j), i <> j.at n=16A034903
- Smallest number that can be made to take n steps to reach 0 under "k -> any product of 2 numbers whose concatenation is k".at n=15A035934
- Number of odd split numbers (A036382) in the interval [2^(n-1), 2^n].at n=14A036384
- Position reached by frog in A038027 or 0 if none. A038026(A038027(n)).at n=6A038028
- Number of partitions satisfying 0 < cn(0,5) + cn(1,5) + cn(2,5) + cn(3,5) and 0 < cn(0,5) + cn(4,5) + cn(2,5) + cn(3,5).at n=28A039903
- Numerators of continued fraction convergents to sqrt(462).at n=3A041880
- Primes p such that p+4 and p+12 are also prime.at n=30A046137