9355
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 11232
- Proper Divisor Sum (Aliquot Sum)
- 1877
- 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
- 7480
- Möbius Function
- 1
- Radical
- 9355
- 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
- 197
- Smith Number
- yes
- 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
- Expansion of x/(1 - 9*x - 11*x^2).at n=5A015587
- Cycle class sequence c(n) (number of true cycles of length n in which a certain node is included) for zeolite NON = Nonasil-[ 4158 ] [Si88O176].4R starting with a T1 atom.at n=12A019209
- a(n) = [ a(n-1)/a(1) + a(n-3)/a(3) + a(n-5)/a(5) + ... ], for n >= 3.at n=29A022865
- a(n) is the area of the triangle with sides prime(n), prime(n+2) and prime(n+4), rounded down to the nearest integer.at n=29A096384
- 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, 0), (-1, 0, -1), (0, 1, 1), (1, -1, 1), (1, 1, -1)}.at n=8A149021
- Coefficients of the expansion of:p(x,t)=(1 - x)/((1 - x*Exp[t*(1 - x)])*(1 - x*Exp[t*(1 + x)])).at n=48A168347
- Smith numbers of order 2.at n=40A174460
- Smallest k>0 such that (5^n-k)*5^n-1 and (5^n-k)*5^n+1 are a twin prime pair or 0 if no such k exists.at n=35A212488
- Minimal natural number (in decimal representation) with n prime substrings in base-6 representation (substrings with leading zeros are considered to be nonprime).at n=14A217306
- Number of partitions of n in which any two parts differ by at most 8.at n=37A218510
- Number of length n+3 0..6 arrays with every four consecutive terms having the sum of some three elements equal to three times the fourth.at n=12A248535
- Apply partial sum operator 5 times to primes.at n=9A254784
- T(n,k) = (1/k!) * Sum_{i=0..k} (-1)^(k-i) * C(k,i) * A185651(n,i); triangle T(n,k), n >= 0, 0 <= k <= n, read by rows.at n=58A258170
- Sum of the smallest parts in the partitions of n into 8 parts.at n=45A308990
- Number of partitions of n into colored blocks of equal parts, such that all colors from a set of size five are used and the colors are introduced in increasing order.at n=16A327288
- Let S be any integer in the range 3 <= S <= 17. Sequence has the property that a(n)*S is the sum of all positive integers whose decimal expansion has <= n digits and contains at most two distinct nonzero digits p and q such that p+q=S.at n=4A328348
- Starting values of maximal runs of at least five integers, each with exactly two distinct prime factors.at n=41A383400
- a(n) = Lucas(n) + 6.at n=18A386707