4756
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
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 8820
- Proper Divisor Sum (Aliquot Sum)
- 4064
- 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
- 2240
- Möbius Function
- 0
- Radical
- 2378
- Omega Function (Ω)
- 4
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 77
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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) = 6*a(n-1) - a(n-2).at n=5A005319
- Number of ways in which n identical balls can be distributed among 5 boxes in a row such that each pair of adjacent boxes contains at least 4 balls.at n=12A005338
- Numbers k such that the continued fraction for sqrt(k) has period 50.at n=26A020389
- a(n) = a(n-1) + a(n-2) + 1, with a(0) = 0 and a(1) = 11.at n=14A022316
- a(n) = prime(n)*prime(n-1) - 1.at n=19A023515
- [ n/{n/sqrt(2)} ], where {x} := x - [ x ].at n=57A024543
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (odd natural numbers), t = A001950 (upper Wythoff sequence).at n=21A024600
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (odd natural numbers), t = A001950 (upper Wythoff sequence).at n=20A025114
- Numbers k such that 177*2^k+1 is prime.at n=40A032465
- Numerators of continued fraction convergents to sqrt(18).at n=4A041026
- Numerators of continued fraction convergents to sqrt(722).at n=6A042390
- Number of partitions of n with equal nonzero number of parts congruent to each of 0, 2, 3 and 4 (mod 5).at n=60A046786
- a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = 2*n - 2 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2 and a(3) = 4.at n=14A049915
- Number of partitions of n with parts (with repetitions) forming a division lattice (i.e., closed under GCD and LCM).at n=52A051839
- a(n) = 2*a(n-1) + a(n-2), with a(0) = 1, a(1) = 2, a(2) = 4.at n=10A052542
- Numbers k > 1 such that, in base 3, k and k^2 contain the same digits in the same proportion.at n=42A061657
- The next smallest pair of numbers is taken so that a(2n-1)/a(2n) converges to sqrt(2).at n=28A065375
- Consider 3 X 3 X 3 Rubik cube, but only allow the <U, R> group to act; sequence gives number of positions that are exactly n moves from the start.at n=9A080628
- Series ratios converge alternately to sqrt(2) and 1+sqrt(1/2).at n=20A082766
- Start with the sequence S(0)={1,1} and for k>0 define S(k) to be I(S(k-1)) where I denotes the operation of inserting, for i=1,2,3..., the term a(i)+a(i+1) between any two terms for which 4a(i+1)<=5a(i). The listed terms are the initial terms of the limit of this process as k goes to infinity.at n=19A082981