9299
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 29
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 9864
- Proper Divisor Sum (Aliquot Sum)
- 565
- 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
- 8736
- Möbius Function
- 1
- Radical
- 9299
- 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
- 135
- 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
- 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 95.at n=24A031593
- Number of partitions of n such that cn(0,5) = cn(1,5) = cn(2,5) <= cn(3,5) = cn(4,5).at n=74A036850
- Numbers having three 9's in base 10.at n=11A043527
- Numbers n such that binomial(2n, n) - 1 is prime.at n=34A066726
- Numbers k such that 1/(1/phi(k) + 1/phi(k+1) + 1/phi(k+2)) is an integer.at n=42A073543
- Indices of primes in sequence defined by A(0) = 43, A(n) = 10*A(n-1) + 23 for n > 0.at n=15A101726
- Near-repdigit semiprimes with 9 as repeated digit.at n=15A105990
- Multiples of 17 whose reversal - 1 is also a multiple of 17.at n=34A166398
- Partial sums of A118371.at n=43A173520
- Numbers n such that x^2+y^2+prime(n)^2=3*x*y*prime(n).at n=14A173957
- a(n) = Sum_{k<=n} A007955(k), where A007955(m) = product of divisors of m.at n=17A175318
- G.f.: 1/(1 - x/(1 - x^2/(1 - x^5/(1 - x^12/(1 - x^29/(1 - x^70/(1 -...- x^Pell(n)/(1 -...)))))))), a continued fraction.at n=20A206743
- n * (11*n^2 + 6*n + 1) / 6.at n=17A215646
- a(n) = k is the smallest number such that k^3 + 1 has exactly n distinct prime factors.at n=9A219108
- An avoidance sequence for a pair of tree patterns that is not the avoidance sequence for any set of permutations.at n=43A221720
- Numbers n such that 3^(n - 3) is congruent to 1 modulo n.at n=1A242865
- Numbers k for which the digital sum of k contains the same distinct digits as k itself.at n=20A249515
- Integers n such that A002110(n) is divisible by A098999(n).at n=37A264897
- Integers k such that k^3 + 1 is the average of two positive cubes.at n=4A273822
- Numbers with digits 2 and 9 only.at n=25A284923