4432
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 8618
- Proper Divisor Sum (Aliquot Sum)
- 4186
- 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
- 2208
- Möbius Function
- 0
- Radical
- 554
- Omega Function (Ω)
- 5
- 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
- 20
- 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
- The generalized Conway-Guy sequence w^{2}.at n=14A006756
- a(n) = a(n-1) + a(n-1-(number of odd terms so far)).at n=30A007604
- Coordination sequence T1 for Zeolite Code MAZ.at n=46A008144
- arctanh(arcsin(sinh(x)))=x+4/3!*x^3+84/5!*x^5+4432/7!*x^7+432144/9!*x^9...at n=3A012107
- Numbers k such that the continued fraction for sqrt(k) has period 50.at n=22A020389
- Discriminants of quintic fields with 4 complex conjugates.at n=19A023685
- a(n) = Sum_{i=1..floor((n+2)/4)} a(2i-1)*a(n-2i+1), with a(1)=a(3)=2 and a(2)=1.at n=11A024959
- A B_2 sequence: a(n) is the least value such that sequence increases and pairwise sums of elements are all distinct.at n=47A025582
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 30 ones.at n=30A031798
- Number of partitions of n into parts not of the form 19k, 19k+2 or 19k-2. Also number of partitions with 1 part of size 1 and differences between parts at distance 8 are greater than 1.at n=34A035971
- Composite numbers whose prime factors contain no digits other than 2 and 7.at n=45A036312
- Coordination sequence T4 for Zeolite Code SFF.at n=44A038434
- Sums of 4 distinct powers of 4.at n=24A038472
- Numbers whose base-4 representation contains exactly three 0's and four 1's.at n=9A045032
- Numbers whose base-5 representation contains exactly two 1's and three 2's.at n=27A045228
- Same rule as Aitken triangle (A011971) except a(0,0)=0, a(1,0)=1.at n=39A046936
- Bessel function J_0(n) is a monotonically decreasing positive sequence.at n=15A046960
- Bessel function |J_0(n)| is a monotonically decreasing positive sequence.at n=27A046962
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 2.at n=45A050029
- a(n) = 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 and a(2) = a(3) = 2.at n=28A050047