9350
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
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 20088
- Proper Divisor Sum (Aliquot Sum)
- 10738
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3200
- Möbius Function
- 0
- Radical
- 1870
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 60
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- a(n) = a(n-1) + a(n-2) - 1 for n > 1, a(0)=3, a(1)=2.at n=19A001612
- a(n) = ceiling(n*phi^19), where phi is the golden ratio, A001622.at n=1A004974
- Number of cyclic binary n-bit strings with no alternating substring of length > 2.at n=18A007039
- Least m such that if r and s in {-F(2*h) + phi*F(2*h-1): h = 1,2,...,n} satisfy r < s, then r < k/m < s for some integer k, where F = A000045 (Fibonacci numbers) and phi = (1+sqrt(5))/2 (golden ratio).at n=9A024851
- a(n) = (d(n)-r(n))/2, where d = A026060 and r is the periodic sequence with fundamental period (1,0,0,0).at n=39A026061
- a(n) = Sum_{d|n} sigma(n/d)*d^3.at n=17A027847
- Numbers whose set of base-13 digits is {3,4}.at n=24A032837
- Number of partitions of n into parts not of the form 21k, 21k+9 or 21k-9. Also number of partitions with at most 8 parts of size 1 and differences between parts at distance 9 are greater than 1.at n=33A035987
- Numbers whose base-5 representation contains exactly two 0's and three 4's.at n=25A045213
- Numbers k such that sopfr(k) = sopfr(k - sopfr(k)).at n=15A050781
- a(n) = floor(tau^n) + 1, where tau = (1 + sqrt(5))/2.at n=19A062724
- a(n) = Lucas(n+1) + (3*(-1)^n - 1)/2.at n=18A074392
- Numbers k such that k^4 has k as a substring of its decimal expansion.at n=44A075904
- a(n) = Lucas(4n+3) + 1, or 5*Fibonacci(2n+1)*Fibonacci(2n+2).at n=4A081015
- Numbers k such that binomial(prime(k), k) is divisible by k^2.at n=27A081384
- A Jacobsthal Fibonacci product.at n=9A093121
- Fourth column (m=3) of (1,6)-Pascal triangle A096956.at n=32A096957
- a(n) = Sum_{k=0..n} Fibonacci(k) + (-1)^k*Fibonacci(k-1).at n=19A097132
- a(n) = Fibonacci(n-1) + Fibonacci(n+1) - (-1)^n.at n=19A098600
- Duplicate of A098600.at n=19A099926