3932
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
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 6888
- Proper Divisor Sum (Aliquot Sum)
- 2956
- 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
- 1964
- Möbius Function
- 0
- Radical
- 1966
- Omega Function (Ω)
- 3
- 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
- 144
- 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
- Coordination sequence T3 for Zeolite Code DAC.at n=40A008069
- [ Sum (s(j) - s(i))^3 ], 1 <= i < j <= n, where s(k) = 1 + 1/2 + ... + 1/k.at n=51A025217
- Coefficients of completely replicable function 50a with a(0) = 1.at n=51A034320
- Multiplicity of highest weight (or singular) vectors associated with character chi_2 of Monster module.at n=51A034390
- Numbers k such that k^4 == 1 (mod 5^4).at n=25A056091
- McKay-Thompson series of class 50a for Monster.at n=51A058703
- Number of partitions of n with positive rank.at n=31A064173
- Positions of powers of 2 in A064413.at n=12A064954
- Number of inequivalent (ordered) solutions to n^2 = sum of 7 squares of integers >= 0.at n=36A065461
- Starting at the integer 0, add one of each base-n digit in base n to a pile and then take from this pile the digits required to construct the current integer. Continue consecutively until reaching an integer, a(n), that requires digits not in the pile.at n=5A092955
- Numbers k such that 216*k+108 is a term of A097703 and A007494 and A098240.at n=4A098241
- Numbers k such that p1=2k+3, p2=4k+5 and p3=6k+7 are all prime.at n=36A105652
- Numbers k such that (k + prime(k)) and (k+1 + prime(k+1)) are divisible by 11.at n=35A107380
- Numbers n such that the sum of the digits of n^phi(n) is divisible by n.at n=13A109660
- a(n) = A121676(n)/(n+1) = [x^n] (1 + x*(1+x)^(n-1) )^(n+1) / (n+1).at n=6A121677
- Expansion of (phi(-q^5) / phi(-q))^2 in powers of q where phi() is a Ramanujan theta function.at n=10A138517
- Position of cubes in the EKG sequence (A064413).at n=15A140418
- Numbers k such that A120292(k) is composite.at n=16A141779
- Let c(n) = x^(2^n-1)*(1-x^(2^n)), g(n) = 1 + x^(2^n-1) + x^(2^n), h(n) = Product_{i=1..n} g(i); then use g.f. (1+2*x) - Sum_{n>=1} c(n)/h(n).at n=62A151684
- Number of zig-zag paths from top to bottom of a rectangle of width 8 with n rows.at n=10A153340