4274
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
- 6414
- Proper Divisor Sum (Aliquot Sum)
- 2140
- 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
- 2136
- Möbius Function
- 1
- Radical
- 4274
- 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
- 64
- 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
- Number of partitions into non-integral powers.at n=28A000327
- Unique period lengths of primes mentioned in A007615.at n=50A007498
- Numbers k such that the continued fraction for sqrt(k) has period 11.at n=37A020350
- a(n) = floor(Sum_{m=1..n} Stirling2(n,m) / binomial(n-1,m-1)).at n=10A024422
- a(n) = Sum_{i=1..floor((n+2)/4)} a(2i-1)*a(n-2i+1), with a(1)=a(2)=1 and a(3)=2.at n=16A024945
- Number of T-frame polyominoes with n cells.at n=39A028247
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted the two central terms are both 18.at n=2A031606
- Numbers k such that 213*2^k+1 is prime.at n=12A032483
- Numbers whose base-5 representation contains exactly two 1's and three 4's.at n=17A045258
- Periods associated with A040017.at n=50A051627
- Sum_{k<=n} (sigma(k)^2), where sigma(k) denotes the sum of the divisors of k A000203.at n=15A072379
- Number of partitions of the n-th decimal palindrome into distinct decimal palindromes.at n=33A091585
- a(1)=1; a(n+1) = Sum_{k=1..n} a(k) a(floor(n/k)).at n=10A097417
- Consider the family of directed multigraphs enriched by the species of trees. Sequence gives number of those multigraphs with n labeled loops and edges.at n=4A099718
- a(n) = a(n-1) + 1 + prime(n), with a(1) = 1.at n=46A110895
- Start with 1 and repeatedly reverse the digits and add 73 to get the next term.at n=16A118221
- a(n) = (3*a(n-1)*a(n-4) - a(n-2)*a(n-3)) / a(n-5).at n=11A122025
- Numbers n whose reverse binary representation has the following property: let a 0 mean "halving" and a 1 mean "k -> 3k+1". The number describes an operation k -> f_n(k). If the equation f_n(k) = k has an integer solution, n is a term in the sequence.at n=26A125754
- Numbers n whose reverse binary representation has the following property: let a 0 mean "halving" and a 1 mean "k -> 3k+1". The number describes an operation k -> f_n(k). If the equation f_n(k) = k has a positive integer solution, n is a term in the sequence.at n=12A125756
- Numbers such that the sum of the factorials of the digits of the fifth power is a square.at n=5A126078