3491
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
- 3492
- 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
- 3490
- Möbius Function
- -1
- Radical
- 3491
- 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
- 149
- 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
- yes
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 488
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes p == 3, 9, 11 (mod 20) such that 2p+1 is also prime.at n=44A000355
- Number of graphs with n nodes, n edges and no isolated vertices.at n=11A006649
- Numbers n such that n, 2n+1, and 4n+3 all prime.at n=24A007700
- Coordination sequence T3 for Zeolite Code MTW.at n=39A008198
- a(n) is prime and sum of all primes <= a(n) is prime.at n=47A013917
- Odd primes such that (3p+1)/2 and 3p+4 are also prime.at n=32A014223
- Primes that remain prime through 2 iterations of function f(x) = 4x + 3.at n=42A023250
- Primes that remain prime through 2 iterations of function f(x) = 6x + 1.at n=34A023256
- Primes that remain prime through 3 iterations of function f(x) = 6x + 1.at n=3A023287
- Primes that remain prime through 3 iterations of function f(x) = 10x + 3.at n=17A023300
- 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 59.at n=1A031557
- Number of partitions of n such that cn(1,5) < cn(0,5) = cn(2,5) <= cn(3,5) = cn(4,5).at n=68A036859
- Numerators of continued fraction convergents to sqrt(93).at n=6A041166
- Numerators of continued fraction convergents to sqrt(372).at n=4A041704
- Numerators of continued fraction convergents to sqrt(613).at n=5A042176
- Numbers n such that string 9,1 occurs in the base 10 representation of n but not of n-1.at n=37A044423
- Numbers m such that string 9,1 occurs in the base 10 representation of m but not of m+1.at n=37A044804
- Discriminants of imaginary quadratic fields with class number 23 (negated).at n=10A046020
- Euclid-Mullin sequence (A000945) with initial value a(1)=67 instead of a(1)=2.at n=26A051323
- Least prime in A031926 (lesser of 8-twins) whose distance to the next 8-twin is 6*n.at n=20A052353