4493
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 4494
- 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
- 4492
- Möbius Function
- -1
- Radical
- 4493
- 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
- 46
- 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
- 610
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- E.g.f. 1/(1 - sin(x) + sin(x)^2).at n=7A002969
- Primes of form k^2 + 4.at n=15A005473
- a(n) is the smallest positive number such that the sum of A001032(n) consecutive squares starting with a(n)^2 is a square.at n=23A007475
- Crystal ball sequence for diamond.at n=17A007904
- Coordination sequence for FeS2-Marcasite, S position.at n=35A009954
- Smallest nonempty set S containing prime divisors of 8k+3 for each k in S.at n=53A020617
- Primes that remain prime through 2 iterations of the function f(x) = 5x + 4.at n=32A023253
- a(n) = (d(n)-r(n))/5, where d = A026060 and r is the periodic sequence with fundamental period (0,0,1,4,0).at n=42A026062
- a(n) = prime(Fibonacci(n)).at n=14A030427
- Lower prime of a pair of consecutive primes having a difference of 14.at n=24A031932
- a(n) = ceiling((n + 1/2)^3).at n=15A034131
- a(n)=(s(n)+3)/9, where s(n)=n-th base 9 palindrome that starts with 6.at n=33A043077
- Numbers whose base-4 representation has exactly 7 runs.at n=34A043598
- Numbers n such that number of runs in the base 4 representation of n is congruent to 0 mod 7.at n=34A043843
- Numbers n such that number of runs in the base 4 representation of n is congruent to 7 mod 8.at n=34A043857
- Numbers n such that number of runs in the base 4 representation of n is congruent to 7 mod 9.at n=34A043865
- Numbers k such that the number of runs in the base-4 representation of k is congruent to 7 (mod 10).at n=34A043874
- Primes of the form p^2 + 4, where p is prime.at n=7A045637
- Numbers k such that 61*2^k-1 is prime.at n=24A050556
- First term of strong prime quintets: p(m+1)-p(m) > p(m+2)-p(m+1) > p(m+3)-p(m+2) > p(m+4)-p(m+3).at n=12A054808