4649
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 4650
- 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
- 4648
- Möbius Function
- -1
- Radical
- 4649
- 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
- 134
- 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
- yes
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 628
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Table of prime factors of 10^n - 1 (with multiplicity).at n=27A001270
- Largest prime factor of the "repunit" number 11...1 (cf. A002275).at n=5A003020
- Largest prime factor of 10^n - 1.at n=6A005422
- Coordination sequence T5 for Zeolite Code MEL.at n=44A008154
- Coordination sequence T4 for Zeolite Code MTT.at n=42A008192
- Coordination sequence T4 for Zeolite Code VNI.at n=42A009910
- Numbers k such that the continued fraction for sqrt(k) has period 11.at n=41A020350
- Primes that remain prime through 2 iterations of function f(x) = 8x + 9.at n=31A023264
- a(n) = least m such that if r and s in {1/2, 1/5, 1/8, ..., 1/(3n-1)} satisfy r < s, then r < k/m < (k+1)/m < s for some integer k.at n=30A024837
- a(n) = least m such that if r and s in {1/2, 1/4, 1/6, ..., 1/2n} satisfy r < s, then r < k/m < (k+2)/m < s for some integer k.at n=29A024842
- Divisors of 9999999.at n=6A027891
- Primes that are palindromic in base 7.at n=17A029975
- 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 27.at n=0A031615
- Primes that are concatenations of n with n + 3.at n=5A032626
- Primes of form x^2+41*y^2.at n=30A033228
- Primes that do not contain any other prime as a proper substring.at n=34A033274
- Coordination sequence T2 for Zeolite Code CFI.at n=45A033600
- Triangle of prime numbers in which n-th row lists all primes p such that 1/p has decimal period n, n >= 1.at n=9A046107
- p, p+2 and p+8 are primes.at n=37A046134
- Primes p such that p+2 and p+8 are also primes but p+6 is not.at n=27A049437