4552
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
- 8550
- Proper Divisor Sum (Aliquot Sum)
- 3998
- 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
- 2272
- Möbius Function
- 0
- Radical
- 1138
- Omega Function (Ω)
- 4
- 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
- 59
- 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-2) - a(n-4).at n=11A006452
- exp(tanh(x)*arcsin(x))=1+2/2!*x^2+8/4!*x^4+110/6!*x^6+4552/8!*x^8...at n=4A012665
- Numbers k such that phi(k) + 9 | sigma(k + 9).at n=41A015788
- a(1) = 5; a(n+1) = a(n)-th nonprime, where nonprimes begin at 4.at n=26A025010
- 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 33.at n=19A031531
- Number of partitions of n with equal nonzero number of parts congruent to each of 0 and 2 (mod 4).at n=40A035547
- a(n) = 6*a(n-1) - a(n-2), n >= 2, a(0)=1, a(1)=4.at n=5A038723
- Numbers whose base-5 representation contains exactly two 1's and three 2's.at n=30A045228
- T(n,n-3), array T as in A054106.at n=29A054107
- T(n,n-3), array T as in A054110.at n=21A054112
- Solutions (value of r) of the Diophantine equation 2*x^2 + 3*x + 2 = r^2.at n=4A055979
- Numbers k such that 2^k + 3 is prime.at n=28A057732
- Euler transform of reduced totient function psi(n), cf. A002322.at n=18A061257
- Number of digits in n^{(n-1)!}.at n=7A067084
- Length of the n-th term in the Roman numeral Look and Say sequence A098595.at n=53A098596
- Position of n! in A025487.at n=14A098718
- McKay-Thompson series of class 36g for the Monster group.at n=35A103262
- McKay-Thompson series of class 8D for the Monster group.at n=27A112143
- McKay-Thompson series of class 16b for the Monster group.at n=27A112151
- Dispersion of the Beatty sequence ([r*n]: n >= 1), where r = 3 + 8^(1/2): square array D(n,m) (n, m >= 1), read by ascending antidiagonals.at n=32A120858