9357
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12480
- Proper Divisor Sum (Aliquot Sum)
- 3123
- 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
- 6236
- Möbius Function
- 1
- Radical
- 9357
- 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
- 60
- 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(1) = 0, a(2) = 0; for n > 2, a(n) - a(n-3) - a(n-5) - ... - a(n-p) = n if n is prime, otherwise = 0, where p = largest prime < n.at n=34A002123
- 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 64.at n=24A031562
- Row 5 of array in A047666.at n=8A047669
- Discriminants of real quadratic fields with class number 1 and related continued fraction period length of 20.at n=23A050969
- Total number of left truncatable primes (without zeros) in base n.at n=13A076623
- a(n) = prime(x) - pi(x) where x is the least x such that (prime(x+1) - pi(x+1)) - (prime(x) - pi(x)) = n.at n=35A111183
- Starting numbers for which the RATS sequence has eventual period 14.at n=24A114615
- Limiting values of A136406: a(n) = A136406(m,m-n) for any m >= 2n.at n=25A137504
- a(n) = Frobenius number for 4 successive primes = F[p(n), p(n+1), p(n+2), p(n+3)].at n=42A138990
- Triangle read by rows: T(n,k) (1<=k<=n) given by T(n, 1) = T(n,n) = 1, otherwise T(n, k) = (m*n-m*k+1)*T(n-1,k-1) + (m*k-m+1)*T(n-1,k), where m = 7.at n=16A142462
- Triangle read by rows: T(n,k) (1<=k<=n) given by T(n, 1) = T(n,n) = 1, otherwise T(n, k) = (m*n-m*k+1)*T(n-1,k-1) + (m*k-m+1)*T(n-1,k), where m = 7.at n=19A142462
- 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, 0, 1), (0, -1, 1), (0, 1, -1), (1, 0, 0), (1, 1, 0)}.at n=7A150568
- a(n) = 2*n*(1 + n + n^2 + n^3) - 3.at n=8A155121
- Partial sums of floor(2^n/7).at n=15A178455
- a(n) is the sum of the smallest parts of all partitions of n that do not contain 1 as a part.at n=36A182708
- Number of partitions of n where the difference between consecutive parts is at most 2.at n=43A224956
- Numbers n such that the decimal expansions of both n and n^2 have 3 as the digit with the smallest value and 9 as the digit with the largest value.at n=6A238553
- Numbers that occur only once in A155043; positions of zeros in A262505, ones in A262507.at n=10A262508
- G.f.: Product_{k>=1} (1 + x^k) / (1 - x^(k^3)).at n=38A280277
- Numbers n such that !n + 7 is prime.at n=17A288451