3673
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 3674
- 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
- 3672
- Möbius Function
- -1
- Radical
- 3673
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 162
- 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
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 513
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes p such that the multiplicative order of 2 modulo p is (p-1)/4.at n=25A001134
- 3 and -3 are both 4th powers (one implies other) mod these primes p=1 mod 8.at n=22A014755
- Numbers k such that the continued fraction for sqrt(k) has period 63.at n=6A020402
- Least inverse of A001390, or 0 if no inverse exists.at n=18A020638
- Positive integers which apparently never result in a palindrome under repeated applications of the function A056964(x) = x + (x with digits reversed).at n=43A023108
- Primes that remain prime through 2 iterations of function f(x) = 5x + 2.at n=41A023252
- Primes that remain prime through 2 iterations of function f(x) = 8x + 3.at n=33A023261
- Primes that remain prime through 2 iterations of the function f(x) = 8*x + 5.at n=26A023262
- Primes that remain prime through 3 iterations of function f(x) = 8x + 5.at n=7A023293
- Position of n^3 + 9 in A024975.at n=31A024979
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 34 ones.at n=12A031802
- Primes of form x^2 + 94*y^2.at n=30A033204
- Conjecturally, a power of 2 written in base 3 cannot have this many 0's.at n=29A036462
- Primes of form abs(2*n^2-199).at n=40A039950
- Denominators of continued fraction convergents to sqrt(386).at n=10A041733
- a(n)=(s(n)+4)/9, where s(n)=n-th base 9 palindrome that starts with 5.at n=23A043076
- Sum of digits of prime(n) raised to its digits' powers is prime.at n=43A046440
- Primes with multiplicative persistence value 5.at n=5A046505
- a(n)=T(n,3), array T as in A049735.at n=34A049746
- Starting positions of strings of 2 9's in the decimal expansion of Pi.at n=39A050272