4369
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
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 4644
- Proper Divisor Sum (Aliquot Sum)
- 275
- 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
- 4096
- Möbius Function
- 1
- Radical
- 4369
- 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
- 46
- Smith Number
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Maximal number of states in the minimal deterministic finite automaton accepting a language over a binary alphabet consisting of some words of length n.at n=15A000802
- sigma_4(n): sum of 4th powers of divisors of n.at n=7A001159
- Sierpiński's triangle (Pascal's triangle mod 2) converted to decimal.at n=12A001317
- Fermat pseudoprimes to base 2, also called Sarrus numbers or Poulet numbers.at n=13A001567
- a(n) = Sum_{k=0..n-1} binomial(2*n,2*k)*a(k)*a(n-k-1).at n=4A002067
- Divisors of 2^16 - 1.at n=12A003527
- Divisors of 2^32 - 1 (for a(1) to a(31), the 31 regular polygons with an odd number of sides constructible with ruler and compass).at n=12A004729
- Smallest number m such that the trajectory of m under iteration of Euler's totient function phi(n) [A000010] contains exactly n distinct numbers, including m and the fixed point.at n=13A007755
- Coordination sequence T4 for Zeolite Code EUO.at n=41A008099
- Coordination sequence T1 for Zeolite Code MFS.at n=41A008173
- If x and y are terms, so is x*y + 9.at n=26A009350
- "Pascal sweep" for k=10: draw a horizontal line through the 1 at C(k,0) in Pascal's triangle; rotate this line and record the sum of the numbers on it (excluding the initial 1).at n=37A009550
- Smallest odd k>n such that k | n^k + n, or 0 if n=2^m.at n=17A015908
- Numerator of sum of -4th powers of divisors of n.at n=7A017671
- Fermat pseudoprimes to base 4.at n=28A020136
- Pseudoprimes to base 16.at n=37A020144
- Pseudoprimes to base 32.at n=44A020160
- Numbers k such that the continued fraction for sqrt(k) has period 46.at n=31A020385
- Triangle of Gaussian binomial coefficients [ n,k ] for q = 16.at n=13A022180
- Triangle of Gaussian binomial coefficients [ n,k ] for q = 16.at n=11A022180