4621
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 4622
- 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
- 4620
- Möbius Function
- -1
- Radical
- 4621
- 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
- 33
- 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
- 624
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Artiads: the primes p == 1 (mod 5) for which Fibonacci((p-1)/5) is divisible by p.at n=24A001583
- Squares written in base 7.at n=40A002440
- Quintan primes: p = (x^5 + y^5)/(x + y).at n=11A002650
- Coordination sequence T3 for Zeolite Code EPI.at n=43A008092
- Expansion of e.g.f.: exp(sinh(x))/exp(x).at n=11A009227
- Smallest positive number that can be written as sum of distinct Fibonacci numbers in n ways.at n=62A013583
- Sum of gcd(x, y) for 1 <= x, y <= n.at n=41A018806
- Primes that remain prime through 3 iterations of function f(x) = 10x + 9.at n=23A023301
- Primes of form k^2 - 3.at n=13A028874
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 52 ones.at n=4A031820
- Lower prime of a pair of consecutive primes having a difference of 16.at n=15A031934
- Upper prime of a difference of 18 between consecutive primes.at n=15A031937
- Primes of form x^2+77*y^2.at n=32A033249
- Value of D for incrementally largest values of minimal x satisfying Pell equation x^2-Dy^2=1.at n=25A033316
- Primes which are not the sum of consecutive composite numbers.at n=26A037174
- Erroneous version of A039952.at n=30A039947
- Maximum cardinality of finite D0L sequence over an alphabet with n symbols.at n=31A039952
- Primes of the form n*phi(n)+1 where phi(n) is the Euler function.at n=29A046062
- Primes of the form 2310*p + 1 where p is a prime.at n=0A051649
- Minimal primorial safe primes: p and primorial*p + 1 are both primes.at n=4A051902