9107
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 10416
- Proper Divisor Sum (Aliquot Sum)
- 1309
- 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
- 7800
- Möbius Function
- 1
- Radical
- 9107
- 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
- 153
- 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
- Pisot sequence T(14,23), a(n)=[ a(n-1)^2/a(n-2) ].at n=14A010922
- Every run of digits of n in base 6 has length 2.at n=34A033004
- Number of optimal binary prefix-free codes with n words all ending in 1.at n=39A055167
- Frobenius number of the numerical semigroup generated by 3 consecutive triangular numbers.at n=20A069755
- n is such that partial sum of pi(k) from 1 to n is divisible by n.at n=4A073162
- Square array, read by antidiagonal: T(n,k) = n*T(n,k-1)+(-1)^k*T(n,floor(k/2)).at n=60A089141
- Triangle of column sequences with a certain o.g.f. pattern.at n=32A112500
- Fifth column of triangle A112500.at n=3A112504
- Number of permutations of length n which avoid the patterns 1324, 3421, 4123.at n=10A116832
- Indices n such that A018910[n] = (Fibonacci[n+3] + 2) are primes.at n=19A121606
- Composite numbers such that exactly ten distinct permutations of digits are prime.at n=29A163562
- a(n) = (n+1)*(6*n^4 - 51*n^3 + 161*n^2 - 251*n + 251).at n=6A165281
- Least k>0 such that (p*2^k-1)/3 is prime, or zero if no k exists, where p=prime(n).at n=15A177330
- Number of matchings in the n-web graph.at n=6A192857
- a(n) = (a(n-1) + a(n-4))/gcd(a(n-1), a(n-4)) with a(1) = a(2) = a(3) = a(4) = 1.at n=51A214652
- Equals two maps: number of nX4 binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal and antidiagonal neighbors in a random 0..2 nX4 array.at n=3A220933
- T(n,k)=Equals two maps: number of nXk binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal and antidiagonal neighbors in a random 0..2 nXk array.at n=24A220935
- Equals two maps: number of 4Xn binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal and antidiagonal neighbors in a random 0..2 4Xn array.at n=3A220938
- Equals two maps: number of n X n binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal and antidiagonal neighbors in a random 0..3 n X n array.at n=3A221287
- T(n,k) = Equals two maps: number of n X k binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal and antidiagonal neighbors in a random 0..3 n X k array.at n=24A221290