4819
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 4960
- Proper Divisor Sum (Aliquot Sum)
- 141
- 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
- 4680
- Möbius Function
- 1
- Radical
- 4819
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 121
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Tetranacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) + a(n-4) with a(0) = a(1) = a(2) = a(3) = 1.at n=15A000288
- Coordination sequence T1 for Scapolite.at n=44A008262
- Number of compositions (p_1, p_2, p_3, ...) of n with 1 <= p_i <= i for all i.at n=15A008930
- Numbers k such that the continued fraction for sqrt(k) has period 54.at n=20A020393
- a(n) = [ 2nd elementary symmetric function of {sqrt(k+1)} ], k = 1,2,...,n.at n=25A025219
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 15 ones.at n=3A031783
- Lucky numbers with size of gaps equal to 14 (lower terms).at n=23A031896
- a(1) = 2; a(n) is smallest number >= a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=40A033679
- a(n) is the smallest composite number c such that A002110(n) + c is prime.at n=17A038771
- Denominators of continued fraction convergents to sqrt(480).at n=6A041917
- Discriminants of imaginary quadratic fields with class number 18 (negated).at n=32A046015
- a(1) = 1, a(2) = 3; for n>2, a(n) = least value > a(n-1) such that pairwise differences are unique.at n=49A051788
- a(n) = (9*n^2 + 13*n + 6)/2.at n=32A064226
- Smallest multiple of (n+1)-st prime which is == 1 mod n-th prime.at n=20A073604
- Expansion of (1-x)/(1-x+x^2+2*x^3).at n=20A078017
- Partial sums of A035282.at n=36A078472
- Number of primes less than 10^n having at least one digit 7.at n=4A091708
- Numbers k such that sigma(phi(k))-phi(sigma(k)) is nonzero and is divisible by (k+1), that is A065395(k)/(k+1) = (phi(sigma(k))-sigma(phi(k)))/(k+1) is a nonzero integer.at n=11A092586
- Numbers n such that n^2+n+41 (Euler's "prime generating polynomial") is not squarefree.at n=26A097823
- Trajectory of 1001 under "3x+1" map.at n=21A100709