9337
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
- 2
- Divisor Sum
- 9338
- 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
- 9336
- Möbius Function
- -1
- Radical
- 9337
- 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
- 153
- 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
- 1155
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- a(n) = floor(n*phi^12), where phi is the golden ratio, A001622.at n=29A004927
- Eleven iterations of Reverse and Add are needed to reach a palindrome.at n=37A015992
- Expansion of 1/((1-7*x)*(1-10*x)*(1-12*x)).at n=3A020974
- Primes that remain prime through 3 iterations of function f(x) = 2x + 5.at n=30A023274
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted the two central terms are both 17.at n=3A031605
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 54 ones.at n=25A031822
- Substrings from the right are prime numbers (using only odd digits different from 5).at n=29A032437
- Numbers whose set of base-13 digits is {3,4}.at n=22A032837
- a(n)=T(n,n+3), array T as in A049735.at n=37A049743
- Primes at which the difference pattern X42Y (X and Y >= 6) occurs in A001223.at n=23A052164
- Numbers which need eleven 'Reverse and Add' steps to reach a palindrome.at n=35A065216
- Primes with either no internal digits or all internal digits are 3.at n=49A069678
- Out of all the n-digit primes, which one takes the longest time to appear in the digits of Pi (ignoring the initial 3)? The answer is a(n), and it appears at position A076130(n).at n=3A076106
- Initial term in sequence of four consecutive primes separated by 3 consecutive differences each <=6 (i.e., when d=2,4 or 6) and forming d-pattern=[4,2,6]; short d-string notation of pattern = [426].at n=7A078850
- a(n) = Sum_{i=1..n} 2^(b(i) - 1), where b(n) is the differences between consecutive primes.at n=39A086769
- Beginning with 3, least prime, greater than the previous term, such that the arithmetic mean of first n terms is a prime.at n=27A090918
- Expansion of 1/sqrt(1-2*x-7*x^2+8*x^3).at n=9A098477
- Primes from merging of 4 successive digits in decimal expansion of exp(2).at n=22A105000
- Primes p such that p's set of distinct digits is {3,7,9}.at n=13A108385
- Sum of the sizes of the Durfee squares of all partitions of n into odd parts.at n=46A116465