9353
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 9600
- Proper Divisor Sum (Aliquot Sum)
- 247
- 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
- 9108
- Möbius Function
- 1
- Radical
- 9353
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 184
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = round(n*phi^11), where phi is the golden ratio, A001622.at n=47A004946
- Sum_{i=0..2n} (C(2n,i) mod 2)*Fibonacci(i+2) = Sum_{i=0..n} (C(n,i) mod 2)*Fibonacci(2i+2).at n=9A048757
- Semiprimes p1*p2 such that p2 > p1 and p2 mod p1 = 11.at n=32A064909
- Composite numbers such that all divisors >1 have the same number of 1's in binary representation.at n=26A089042
- Expansion of (1-x)^2/((1-x)^3-2x^4).at n=15A097119
- Semiprimes in A056106.at n=19A113524
- Start with 1015 and repeatedly reverse the digits and add 4 to get the next term.at n=64A117807
- Denominators of the continued fraction convergents of the decimal concatenation of the lower bound of twin primes.at n=14A128845
- Composite numbers generated by the Euler polynomial x^2 + x + 41.at n=13A145292
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, 1), (0, 1, 1), (1, 0, -1), (1, 1, 0)}.at n=7A150604
- Minimal exponents m such that the fractional part of (Pi-2)^m obtains a minimum (when starting with m=1).at n=11A153717
- a(n) = 12*n^2 + 22*n + 11.at n=27A154106
- n times the n-th noncomposite.at n=46A164931
- Numbers that are the product of two distinct primes a and b, such that a^3+b^3 is the average of a twin prime pair.at n=30A176876
- Prime-generating polynomial: a(n) = 25*n^2 - 1185*n + 14083.at n=43A181963
- Half the number of (n+1) X 2 binary arrays with no 2X2 subblock having exactly 2 ones.at n=9A183774
- T(n,k) = half the number of (n+1) X (k+1) binary arrays with no 2 X 2 subblock having exactly 2 ones.at n=36A183782
- Number of strings of numbers x(i=1..n) in 0..6 with sum i*x(i) equal to n*6.at n=7A184700
- Number of strings of numbers x(i=1..8) in 0..n with sum i*x(i) equal to n*8.at n=5A184708
- G.f.: Sum_{n>=0} x^n * Product_{k=1..n} (1 + (1+x)^k).at n=8A207081