4841
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 4992
- Proper Divisor Sum (Aliquot Sum)
- 151
- 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
- 4692
- Möbius Function
- 1
- Radical
- 4841
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 103
- 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
- Tribonacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) with a(0)=0, a(1)=1, a(2)=0.at n=17A001590
- Largest number not the sum of distinct n-th-order polygonal numbers.at n=22A007419
- Coordination sequence T1 for Zeolite Code -CHI.at n=44A009846
- Expansion of e.g.f. exp(arcsin(tanh(x))).at n=10A012123
- Expansion of e.g.f. cosh(arcsin(tanh(x))) (even powers only).at n=5A012131
- Number of ordered 5-tuples of integers from [ 1,n ] with no common factors among triples.at n=15A015656
- A015938(n)-2^n.at n=28A015939
- a(n) = (d(n)-r(n))/5, where d = A026057 and r is the periodic sequence with fundamental period (1,0,3,1,0).at n=45A026059
- (d(n)-r(n))/5, where d = A026066 and r is the periodic sequence with fundamental period (0,3,1,0,1).at n=40A026068
- Number of dyslexic identity planted planar trees with n+1 nodes.at n=11A032101
- Concatenations of two squares in two ways.at n=5A038670
- Numbers whose base-5 representation contains exactly two 1's and three 3's.at n=29A045243
- Consider all quadruples {a,b,c,d} which reach {k,k,k,k} in n steps under map {a,b,c,d}->{|a-b|,|b-c|,|c-d|,|d-a|}; look at max{a,b,c,d}; sequence gives minimal value of this.at n=22A045794
- a(n) = Sum_{k=0..n} T(n, k), array T as in A047080.at n=14A047081
- Composite numbers k such that sigma(k + 6!) = sigma(k + 720) = sigma(k) + 720.at n=40A054984
- Fourth spoke of a hexagonal spiral.at n=40A056108
- Semiprimes p1*p2 such that p2 mod p1 = 9, with p2 > p1.at n=24A064907
- Minimum value t such that all quadruples of Diffy_length >= n have a maximal value >= t.at n=24A065678
- Smallest argument m such that commutator[phi(m), gpf(m)] = 2n-1, where phi(m) = A000010(m) and gpf(m) = A006530(m), the largest prime factor of m.at n=39A070818
- a(1) = 3; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=35A074339