9562
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
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 16416
- Proper Divisor Sum (Aliquot Sum)
- 6854
- 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
- 4092
- Möbius Function
- -1
- Radical
- 9562
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 122
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- yes
- Odd
- no
Appears in sequences
- a(1) = 7; a(n+1) = a(n)-th nonprime, where nonprimes begin at 0.at n=33A025002
- Numbers whose base-2 representation has exactly 12 runs.at n=20A043579
- Numbers whose base-4 representation contains exactly four 1's and three 2's.at n=20A045108
- Becomes prime or 4 after exactly 8 iterations of f(x) = sum of prime factors of x.at n=37A048130
- Number of positive integers <= 2^n of form 7 x^2 + 8 y^2.at n=17A054187
- Indices of primes in sequence defined by A(0) = 63, A(n) = 10*A(n-1) + 43 for n > 0.at n=5A101535
- Triangle T, read by rows, where row n of T = row n-1 of T^fibonacci(n) with appended '1' for n>=1 starting with a single '1' in row 0.at n=40A136170
- Binomial transform of [1, 0, 0, 4, 0, 0, 7, 0, 0, 10, ...].at n=12A139545
- Number of binary strings of length n with no substrings equal to 0000 or 0010.at n=15A164387
- Partial sums of the generalized Cuban primes A007645.at n=43A172113
- 1/16 the number of (n+1) X 6 0..3 arrays with all 2 X 2 subblocks having the same four values.at n=10A184035
- Number of 3-element subsets of {1,...,n} whose sum has more than 2 divisors.at n=42A241563
- Least k such that prime(n) is the smallest prime p for which k^2 + p^2 is also prime, or 0 if none.at n=32A263466
- Numbers k such that (8*10^k - 77)/3 is prime.at n=23A272929
- Number of n X n 0..2 arrays with no element equal to more than one of its king-move neighbors and with new values introduced in order 0 sequentially upwards.at n=8A280852
- a(n) = 75*2^n - 38.at n=7A304612
- Numbers with equal number of even and odd digits such that the product a(n) * a(n+1) has an equal number of even and odd digits too.at n=43A339715