9751
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
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 11400
- Proper Divisor Sum (Aliquot Sum)
- 1649
- 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
- 8316
- Möbius Function
- 0
- Radical
- 1393
- Omega Function (Ω)
- 3
- 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
- 122
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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(n) = round(n*phi^11), where phi is the golden ratio, A001622.at n=49A004946
- Consider all ways of writing a number as p+2m^2 where p is 1 or a prime and m >= 0; sequence gives numbers that are expressible in at least 2 more ways than any smaller number.at n=10A016067
- Expansion of 1/((1-4x)(1-5x)(1-6x)).at n=4A016103
- Sums of 7 distinct powers of 3.at n=27A038469
- Triangle of Lehmer-Comtet numbers of 2nd kind.at n=23A039621
- a(n) = n^2*(n^2+3)/4.at n=13A039623
- Smallest integer that can be expressed as p+2m^2 in more ways than any smaller number, where m >= 0 and p = 1 or prime.at n=31A055202
- Numbers k where the root mean square (RMS) of k and 7 is an integer, i.e., sqrt((k^2 + 7^2)/2) is an integer.at n=13A076293
- Positions of 9 in partition of decimal expansion of Pi A104807.at n=32A104809
- On the standard 33-hole cross-shaped peg solitaire board, the number of distinct board positions after n jumps (starting with the center vacant).at n=8A112737
- Odd digits in decreasing order.at n=28A119252
- Numbers such that the digital sums in bases 2, 3, 5 and 7 all are equal.at n=13A135127
- 4-Stirling numbers of the second kind.at n=23A143496
- Number of n X n binary arrays symmetric under 180 degree rotation with all ones connected only in a 0100-0100-1111-0010 pattern in any orientation.at n=10A147034
- Composite numbers such that exactly ten distinct permutations of digits are prime.at n=39A163562
- Numbers of the form 12n+7 for which Sum_{i=0..(4n+2)} J(i,12n+7) = 0, where J(i,m) is the Jacobi symbol.at n=30A165463
- Number of n X 2 1..5 arrays containing at least one of each value, all equal values connected, rows considered as a single number in nondecreasing order, and columns considered as a single number in increasing order.at n=5A166816
- Numbers k such that k^2+1 = 2p,(k+1)^2+1 = 5q, (k+2)^2+1 = 10r where p, q, and r are primes.at n=15A181619
- Numbers n such that m=(n^2+1)/2, p=(m^2+1)/2 and q=(p^2+1)/2 are all prime.at n=8A188546
- Sequence of pairs k,g such that k*2^n-1, k*2^n-1+g, k*2^n-1+2*g, and k*2^n+3*g are four consecutive primes in arithmetic progression for the smallest odd k.at n=40A230699