9307
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 9576
- Proper Divisor Sum (Aliquot Sum)
- 269
- 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
- 9040
- Möbius Function
- 1
- Radical
- 9307
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 91
- 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 period 82.at n=21A020421
- a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ... + a(n-3)*a(3) for n >= 4, with initial terms 0, 1, 1, 0.at n=22A025250
- 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=25A031593
- Numbers k such that 219*2^k+1 is prime.at n=33A032486
- Digitally balanced numbers in both bases 2 and 3.at n=34A049361
- Numbers n such that 211*2^n-1 is prime.at n=13A050857
- 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)] and [0; a(1), a(2), a(3), ..., a(n)].at n=17A058082
- Numbers n such that { x +- 2^k : 0 < k < 4 } are primes, where x = 210*n - 105.at n=6A061671
- Sum_{k<=n} (sigma(k)^2), where sigma(k) denotes the sum of the divisors of k A000203.at n=20A072379
- Numbers k such that sigma(phi(k))-phi(sigma(k)) is nonzero and is divisible by (k-1), that is A065395(k)/(k-1) = (phi(sigma(k))-sigma(phi(k)))/(k-1) is a nonzero integer.at n=9A092585
- Numerators of the Engel partial sums for L(3, chi3), where L(s, chi3) is the Dirichlet L-function for the non-principal character modulo 3.at n=5A129660
- a(0)=0. a(n) = a(n-1) + sum of positive integers which are <= n and not part of the sequence.at n=39A129694
- a(n) = (9*n^2 + 9*n - 16)/2.at n=44A166148
- Number of (n+1)X6 0..2 arrays with each element of every 2X2 subblock being the sum mod 3 of two others.at n=0A183832
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with each element of every 2X2 subblock being the sum mod 3 of two others.at n=10A183836
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with each element of every 2X2 subblock being the sum mod 3 of two others.at n=14A183836
- Upper s-Wythoff sequence, where s=A081276 (eighth cubes). Complement of A184431.at n=40A184432
- Number of 6's in the last section of the set of partitions of n.at n=45A206556
- Number of n X 2 binary arrays whose sum with another n X 2 binary array containing no more than a single 1 has rows and columns in lexicographically nondecreasing order.at n=14A225894
- Row sums of triangle A027420.at n=40A241944