9958
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 31
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 16128
- Proper Divisor Sum (Aliquot Sum)
- 6170
- 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
- 4584
- Möbius Function
- -1
- Radical
- 9958
- 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
- 42
- 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(n) = a(n-1) + a(n-2) + 1, with a(0) = 1 and a(1) = 4.at n=17A022318
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Fibonacci numbers), t = (primes).at n=21A024468
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Fibonacci numbers), t = (primes).at n=20A025088
- Main diagonal of Inverse Stolarsky array.at n=7A035509
- Denominators of continued fraction convergents to sqrt(868).at n=5A042677
- Base-7 palindromes that start with 4.at n=23A043018
- a(n) = Sum_{i=0..n} T(i,n-i) where T is A049627.at n=45A049628
- a(1) = 1; a(n+1) = sum of terms in continued fraction for the sum of the continued fractions, [a(1); a(2), a(3),...,a(n-1),a(n)] and [a(n); a(n-1), a(n-2),...,a(2), a(1)].at n=12A058081
- Numbers n such that [A070080(n), A070081(n), A070082(n)] is an obtuse isosceles integer triangle with prime side lengths.at n=19A070135
- Number of squarefree integers in closed interval [2^n, -1 + 2*2^n], i.e., among 2^n consecutive numbers beginning with 2^n.at n=14A077643
- sigma(n) plus the n-th prime gives a square.at n=40A114082
- Expansion of q^(-3/4) * eta(q)^2 * eta(q^2)^4 * eta(q^8)^4 / eta(q^4)^6 in powers of q.at n=35A135467
- Number of paths from (0,0) to (n+2,n) using only up and right steps and avoiding two or more consecutive moves up or three or more consecutive moves right.at n=38A177787
- Numbers that have 9 terms in their Zeckendorf representation.at n=19A179249
- Number of 4-step S, NW and NE-moving king's tours on an n X n board summed over all starting positions.at n=20A187378
- Palindromic in bases 7 and 29.at n=16A249158
- The number of combinatorial equivalence classes of n-endomorphisms on a rank-3 semigroup.at n=2A257919
- Palindromic numbers in bases 4 and 7 written in base 10.at n=10A259378
- Number of non-isomorphic multiset partitions of weight n with no singletons in which all parts are aperiodic multisets.at n=11A320804
- Numbers k such that 429*2^k+1 is prime.at n=33A323115