4147
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 5040
- Proper Divisor Sum (Aliquot Sum)
- 893
- 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
- 3360
- Möbius Function
- -1
- Radical
- 4147
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 38
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- Number of simplicial 3-clusters with n cells.at n=8A007173
- Coordination sequence T5 for Zeolite Code NES.at n=41A008209
- Orders of cyclotomic polynomials containing a coefficient the absolute value of which is >= 4.at n=25A013592
- Number of balls in pyramid with base either a regular hexagon or a hexagon with alternate sides differing by 1 (balls in hexagonal pyramid of height n taken from hexagonal close-packing).at n=25A019298
- Fibonacci sequence beginning 0, 11.at n=14A022345
- a(n) is least k such that k and 2k are anagrams in base n (written in base 10).at n=9A023094
- Expansion of 1/((1-2*x)*(1-6*x)*(1-7*x)*(1-8*x)).at n=3A026324
- Concatenation of n and n + 6 or {n,n+6}.at n=40A032611
- Dirichlet convolution of d(n) (# of divisors) with Bell numbers.at n=8A034775
- Number of ordered rooted trees with n non-root nodes and all outdegrees <= four.at n=9A036766
- Numbers whose maximal base-6 run length is 4.at n=26A037987
- Bisection of A028289.at n=36A038390
- Numbers having four 1's in base 6.at n=22A043376
- Numbers having, in base 16, (sum of even run lengths)=(sum of odd run lengths).at n=17A044887
- Numbers whose base-4 representation contains exactly four 0's and one 1.at n=30A045034
- Numbers whose base-4 representation contains exactly four 0's and no 2's.at n=31A045057
- Numbers whose base-4 representation contains exactly four 0's and two 3's.at n=6A045083
- a(n) = least composite number such that sigma(a(n)+n!) = sigma(a(n))+n! where sigma() = A000203.at n=6A054982
- Expansion of (1+3*x)/(1-x)^10.at n=5A055843
- Composite n such that sigma(n)-phi(n) divides sigma(n)+phi(n).at n=37A061367