3286
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
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 5184
- Proper Divisor Sum (Aliquot Sum)
- 1898
- 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
- 1560
- Möbius Function
- -1
- Radical
- 3286
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 74
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- yes
- Odd
- no
Appears in sequences
- 9-gonal (or enneagonal or nonagonal) numbers: a(n) = n*(7*n-5)/2.at n=31A001106
- a(1) = 0, a(2) = 0; for n > 2, a(n) - a(n-3) - a(n-5) - ... - a(n-p) = n if n is prime, otherwise = 0, where p = largest prime < n.at n=30A002123
- Coordination sequence T1 for Zeolite Code ANA.at n=37A008031
- Powers of fourth root of 19 rounded up.at n=11A018101
- Number of stable n-celled patterns ("still lifes") in Conway's Game of Life, up to rotation and reflection.at n=15A019473
- Even 9-gonal (or enneagonal) numbers.at n=15A028992
- a(n) = (2*n+1)*(7*n+1).at n=15A033572
- Coordination sequence T3 for Zeolite Code CFI.at n=38A033601
- Number of partitions of n into parts not of the form 25k, 25k+11 or 25k-11. Also number of partitions with at most 10 parts of size 1 and differences between parts at distance 11 are greater than 1.at n=27A036010
- Denominators of continued fraction convergents to sqrt(494).at n=9A041943
- Numbers having four 1's in base 5.at n=27A043356
- Numbers k such that the string 5,1 occurs in the base 9 representation of k but not of k-1.at n=44A044297
- Numbers n such that string 8,6 occurs in the base 10 representation of n but not of n-1.at n=35A044418
- Numbers n such that string 8,6 occurs in the base 10 representation of n but not of n+1.at n=35A044799
- Values of k for which A075059(k) = A003418(k) + 1 is prime.at n=73A049537
- Number of stable n-celled patterns ("still lifes") in Conway's game of Life (incorrect version).at n=15A056605
- Numbers n such that 2^n in base 3 has same number of 2's as 2^(n+1) in base 3 and 2^n and 2^(n+1) have the same number of digits in base 3.at n=34A056736
- a(n) = n times the Collatz number of n (as given in A006577).at n=30A058261
- Numbers k such that k*2^m+1 is prime for exactly one exponent m in the range 0<=m<=k.at n=28A061155
- Potential Sierpiński numbers: integers for which the smallest m > 2^10 in A040076 such that n*2^m+1 is prime (A050921).at n=9A064721