9749
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
- 4
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 9750
- Proper Divisor Sum (Aliquot Sum)
- 1
- 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
- 9748
- Möbius Function
- -1
- Radical
- 9749
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1203
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Number of chord diagrams with n chords; number of pairings on a necklace.at n=7A007769
- Number of partitions of n into at most 8 parts.at n=40A008637
- a(0) = 1, a(n) = 27*n^2 + 2 for n>0.at n=19A010017
- Primes that remain prime through 3 iterations of function f(x) = 9x + 2.at n=26A023296
- Number of partitions of n in which the greatest part is 8.at n=48A026814
- Primes of the form k^2 + (k+1)^2 + (k+2)^2 = 3*(k+1)^2+2.at n=8A027864
- Lower prime of a difference of 18 between consecutive primes.at n=38A031936
- Dirichlet convolution of Catalan numbers (1,2,5,14...) with themselves.at n=8A034717
- Numerators of continued fraction convergents to sqrt(597).at n=7A042144
- Numbers n such that 169*2^n-1 is prime.at n=19A050836
- Smallest value of x such that M(x) = -n, where M(x) is Mertens's function A002321.at n=35A051401
- Inverse Mertens function: smallest k such that |M(k)| = n, where M(x) is Mertens's function A002321.at n=35A051402
- Primes p such that p^12 reversed is also prime.at n=27A059705
- An inverse to Mertens's function: smallest k >= 2 such that Mertens's function |M(k)| (see A002321) is equal to n.at n=36A060434
- Primes starting and ending with 9.at n=22A062335
- Zero, together with positive numbers k such that prime(k) + k is a square.at n=36A064371
- The first of two consecutive primes with equal digital sums.at n=24A066540
- a(1) = 2, a(2) = 3, a(3) = 5 and a(n) = the smallest prime which is a linear combination of previous three terms with all coefficients >=1.at n=12A072536
- Smallest k such that |M(k)| = n^2, where M(x) is Mertens's function A002321.at n=5A084234
- Smallest prime of the form 10^k - prime(n), or 0 if no such prime exists.at n=53A090289