9601
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 9602
- 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
- 9600
- Möbius Function
- -1
- Radical
- 9601
- 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
- 166
- 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
- 1185
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes that remain prime through 3 iterations of function f(x) = 2x + 9.at n=23A023276
- Numbers whose least quadratic nonresidue (A020649) is 13.at n=27A025025
- Number of partitions of n into an even number of parts, the least being 2; also, a(n+2) = number of partitions of n into an odd number of parts, each >=2.at n=48A027194
- Primes of form k^2 - 3.at n=18A028874
- Upper prime of a record difference between it and the second prime before it.at n=13A031134
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 74 ones.at n=4A031842
- Primes p with property that p concatenated with its emirp p' (prime reversal) forms a palindromic prime of the form 'primemirp' (rightmost digit of p and leftmost digit of p' are blended together - p and p' palindromic allowed).at n=48A054217
- Second term of strong prime 5-tuples: p(m)-p(m-1) > p(m+1)-p(m) > p(m+2)-p(m+1) > p(m+3)-p(m+2).at n=26A054809
- Third term of strong prime 5-tuples: p(m-1)-p(m-2) > p(m)-p(m-1) > p(m+1)-p(m) > p(m+2)-p(m+1).at n=25A054810
- Third term of strong prime sextets: p(m-1)-p(m-2) > p(m)-p(m-1) > p(m+1)-p(m) > p(m+2)-p(m+1) > p(m+3)-p(m+2).at n=3A054815
- Numbers n such that (6^n + 1)/7 is a prime.at n=10A057172
- Primes with 13 as smallest positive primitive root.at n=23A061326
- Primes p such that the greatest prime divisor of p-1 is 5.at n=32A061599
- Primes of form 100*k + 1.at n=28A062800
- Proth primes: primes of the form k*2^m + 1 with odd k < 2^m, m >= 1.at n=34A080076
- Primes arising as successive differences in A088049. a(n) = A088049(n+1)-A088049(n).at n=24A088050
- Primes arising as the successive difference of terms of A088052. a(n) = A088052(n+1)-A088052(n).at n=17A088053
- Primes of the form 6*k^2 + 1.at n=11A090687
- Prime numbers which when written in base 7 have a composite digit-sum.at n=2A096790
- Reverse digits of largest primes, append to sequence if result is larger prime then previous one with reverse digits.at n=15A098922