4094
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
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 6480
- Proper Divisor Sum (Aliquot Sum)
- 2386
- 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
- 1936
- Möbius Function
- -1
- Radical
- 4094
- Omega Function (Ω)
- 3
- 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
- 157
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- Generalized class numbers c_(n,1).at n=36A000233
- Number of self-complementary Boolean functions of n variables: see Comments for precise definition.at n=5A000610
- a(n) = 2^n - 2.at n=12A000918
- Number of down-up permutations of n+4 starting with 4.at n=6A006216
- Coordination sequence T5 for Zeolite Code DDR.at n=40A008075
- Coordination sequence T1 for Zeolite Code HEU.at n=42A008116
- Coordination sequence T2 for Zeolite Code LTL.at n=47A008139
- Boustrophedon version of triangle of Euler-Bernoulli or Entringer numbers read by rows.at n=48A008280
- Triangle of Euler-Bernoulli or Entringer numbers read by rows.at n=48A008281
- Triangle of Euler-Bernoulli or Entringer numbers read by rows: T(n,k) is the number of down-up permutations of n+1 starting with k+1.at n=38A008282
- Read across rows of Euler-Bernoulli or Entringer triangle.at n=23A008283
- Triangle of Euler-Bernoulli or Entringer numbers.at n=42A010094
- a(n) = floor( n*(n-1)*(n-2)/27 ).at n=49A011909
- a(n) = n*(2*n-3).at n=46A014107
- Expansion of (1+x)/(1-x-4*x^2).at n=9A026597
- a(2*n) = 3*2^n - 2; a(2*n+1) = 2^(n+2) - 2.at n=21A027383
- 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 62.at n=19A031560
- Otto Haxel's guess for magic numbers of nuclear shells.at n=23A033547
- Sums of 11 distinct powers of 2.at n=11A038462
- Maximum cycle length in differentiation digraph for n-bit binary sequences.at n=45A038553