9649
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 28
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 9650
- 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
- 9648
- Möbius Function
- -1
- Radical
- 9649
- 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
- 60
- 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
- 1192
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Euclid-Mullin sequence: a(1) = 2, a(n+1) is smallest prime factor of 1 + Product_{k=1..n} a(k).at n=40A000945
- Expansion of e.g.f.: exp(arcsin(sinh(x)))=1+x+1/2!*x^2+3/3!*x^3+9/4!*x^4+41/5!*x^5...at n=8A012099
- cosh(arcsin(sinh(x)))=1+1/2!*x^2+9/4!*x^4+201/6!*x^6+9649/8!*x^8...at n=4A012108
- From table of maximal epacts e(p) and corresponding primes p, for x_1=2, x_{m+1} = (x_m)^2+1; sequence gives p.at n=29A014424
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 62 ones.at n=12A031830
- Numbers k such that 65*2^k+1 is prime.at n=33A032382
- Primes whose sum of digits is the perfect number 28.at n=24A048517
- Primes whose digits are composite; primes having only {4, 6, 8, 9} as digits.at n=19A051416
- First member of a prime triple in a p^2 + p - 1 progression.at n=42A057324
- Prime lucky numbers k (from A031157) such that nextprime(k)=nextlucky(k).at n=17A057698
- Primes p such that x^16 = 2 has no solution mod p, but x^8 = 2 has a solution mod p.at n=18A059287
- Primes p such that x^67 = 2 has no solution mod p.at n=19A059330
- Primes p such that x^18 = 2 has no solution mod p, but x^6 = 2 has a solution mod p.at n=20A059664
- Primes p such that x^54 = 2 has no solution mod p, but x^6 = 2 has a solution mod p.at n=21A059665
- Primes p such that x^36 = 2 has no solution mod p, but x^12 = 2 has a solution mod p.at n=15A059668
- Primes p such that x^48 = 2 has no solution mod p, but x^24 = 2 has a solution mod p.at n=14A059669
- Primes p such that p^9 reversed is also prime.at n=28A059702
- Primes that are each the sum of two, three, and four consecutive composite numbers.at n=13A060339
- Primes having only 0,4,6,8,9 as digits.at n=31A061372
- Primes starting and ending with 9.at n=17A062335