3955
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
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 5472
- Proper Divisor Sum (Aliquot Sum)
- 1517
- 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
- 2688
- Möbius Function
- -1
- Radical
- 3955
- 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
- 144
- 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
- no
- Odd
- yes
Appears in sequences
- Coordination sequence T7 for Zeolite Code MFI.at n=40A008170
- Coordination sequence T1 for Zeolite Code NON.at n=38A008212
- a(n) = floor(Gamma(n+10/11)/Gamma(10/11)).at n=7A020050
- a(n) = 1*t(n) + 2*t(n-1) + ... + k*t(n+1-k), where k=floor((n+1)/2) and t(n)=2*n+1 (odd numbers).at n=27A023865
- a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n-k+1), where k = floor(n/2), s = natural numbers, t = odd natural numbers.at n=26A024862
- Expansion of 1/((1-4x)(1-5x)(1-6x)(1-8x)).at n=3A028110
- Lucky numbers with size of gaps equal to 14 (lower terms).at n=15A031896
- Incrementally largest terms in continued fraction for Copeland-Erdős constant.at n=9A033310
- a() = 1,3,... [ A037257 ], differences = 2,... [ A037258 ] and 2nd differences [ A037259 ] are disjoint and monotonic; adjoin next free number to 2nd differences unless it would produce a duplicate in which case ignore.at n=24A037257
- Number of partitions satisfying cn(0,5) + cn(2,5) < cn(1,5) + cn(4,5) and cn(0,5) + cn(3,5) < cn(1,5) + cn(4,5).at n=30A039885
- Denominators of continued fraction convergents to sqrt(478).at n=9A041913
- a(n) = Sum_{k=1..floor((n+1)/2)} T(n,2k-1), array T as in A049777.at n=27A049778
- a(n) = (n^3 + 24*n^2 + 65*n + 36)/6.at n=22A087863
- Triangle T(m,k) read by rows, where T(m,k) is the number of ways in which 1 <= k <= m positions can be picked in an m X m square array such that their adjacency graph consists of a single component. Two positions (s,t), (u,v) are considered as adjacent if max(abs(s-u), abs(t-v)) <= 1.at n=31A098485
- Expansion of 1/(1-x*(1-3*x)).at n=15A106852
- Number of unordered pairs of partitions of n (into distinct parts) with empty intersection.at n=26A108796
- Integers k such that 3*10^k + 71 is a prime number.at n=11A110933
- Each term is previous term plus ceiling of geometric mean of all previous terms.at n=50A114830
- a(2*n+1) = 5*a(n), a(2*n+2) = 6*a(n) + a(n-1).at n=33A116553
- Expansion of 1/(1 - x - x^2 + x^4 - x^6).at n=21A117791