9349
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
- 4
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 9350
- 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
- 9348
- Möbius Function
- -1
- Radical
- 9349
- 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
- yes
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 60
- 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
- 1158
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Lucas numbers (beginning with 1): L(n) = L(n-1) + L(n-2) with L(1) = 1, L(2) = 3.at n=18A000204
- Associated Mersenne numbers.at n=19A001350
- Smallest primitive prime factor of Fibonacci number F(n), or 1 if F(n) has no primitive prime factor.at n=37A001578
- A Fielder sequence: a(n) = a(n-1) + a(n-3) + a(n-4), n >= 4.at n=19A001638
- Bisection of Lucas sequence: a(n) = L(2*n+1).at n=9A002878
- a(n) = floor(n*phi^19), where phi is the golden ratio, A001622.at n=1A004934
- a(n) = round(n*phi^19), where phi is the golden ratio, A001622.at n=1A004954
- a(n) = 3*a(n-2) - a(n-4), a(0)=0, a(1)=1, a(2)=1, a(3)=4. Alternates Fibonacci (A000045) and Lucas (A000032) sequences for even and odd n.at n=19A005013
- a(n) = L(L(n+1)+1), where L(n) are Lucas numbers A000032.at n=5A005372
- Prime Lucas numbers (cf. A000032).at n=10A005479
- a(n) = floor(phi^n), where phi = (1+sqrt(5))/2 is the golden ratio.at n=19A014217
- Odd Lucas numbers.at n=12A014447
- a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = (Lucas numbers), t = A023533.at n=52A024476
- a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n-k+1), where k = floor(n/2), s = A000032, t = A023533.at n=51A025096
- Integer ratios of Fibonacci numbers F(m)/F(n).at n=50A031121
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 74 ones.at n=2A031842
- Prime factors of |numerator(B(2n))| which are >= 2n+3.at n=10A046753
- a(n) = 4*a(n-1) + a(n-2); a(0)=1, a(1)=7.at n=6A048876
- a(n) = F(n) / Product_{p|n} F(p), where F(k) is k-th Fibonacci number and the p's in product are the distinct primes dividing n.at n=37A051348
- Number of polyominoes with n cells, symmetric about diagonal 2.at n=38A056878