4846
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
- 5
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 7272
- Proper Divisor Sum (Aliquot Sum)
- 2426
- 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
- 2422
- Möbius Function
- 1
- Radical
- 4846
- 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
- 72
- 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
- yes
- Odd
- no
Appears in sequences
- a(n) = floor( n*(n-1)*(n-2)/29 ).at n=53A011911
- Values of k at which the period of the continued fraction for sqrt(k) sets a new record.at n=39A013645
- Fibonacci sequence beginning 3, 11.at n=14A022123
- a(n) = M(n) + m(n) for n >= 2, where M(n) = max{ a(i) + a(n-i): i = 1..n-1 }, m(n) = min{ a(i) + a(n-i): i = 1..n-1 }.at n=22A022905
- a(n) = least m such that if r and s in {1/1, 1/4, 1/7, ..., 1/(3n-2)} satisfy r < s, then r < k/m < (k+1)/m < s for some integer k.at n=31A024836
- a(n) = least m such that if r and s in {1/1, 1/3, 1/5, ..., 1/(2n-1)} satisfy r < s, then r < k/m < (k+2)/m < s for some integer k.at n=30A024841
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 68.at n=17A031566
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 70 ones.at n=0A031838
- Numbers n such that 117*2^n-1 is prime.at n=35A050584
- Numbers k such that k*2^m+1 is prime for exactly one exponent m in the range 0<=m<=k.at n=41A061155
- G.f.: Sum_{n >= 1} x^n/(1-x^n)^5.at n=16A073570
- Interprimes (A024675) which are of the form s*prime, s=2.at n=34A075277
- Triangle read by rows of number of Catalan paths (nonnegative, starting and ending at 0, step +/-1) of 2n steps with all values less than or equal to k.at n=42A080935
- Number of Catalan paths (nonnegative, starting and ending at 0, step +-1) of 2*n steps with all values less than or equal to 7.at n=9A080938
- n*nextprime((n-1)!)-nextprime(n!).at n=36A089014
- a(n) = {A089713(n)+A070219(n)}/2.at n=45A089715
- Number of cycles in range [A014137(n-1)..A014138(n-1)] of permutation A089869/A089870.at n=10A090827
- Number of A095285-primes in range ]2^n,2^(n+1)].at n=15A095295
- Number of A095313-primes in range [2^n,2^(n+1)].at n=15A095333
- 1045*6^n/27-513*2^(n-2)-2072*3^(n-3)+670*(-1)^n*3^(n-3)+254*(-1)^(n+1), n>1.at n=2A121804