3122
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 5376
- Proper Divisor Sum (Aliquot Sum)
- 2254
- 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
- 1332
- Möbius Function
- -1
- Radical
- 3122
- 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
- 61
- 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
- a(n) = number of solid (i.e., three-dimensional) partitions of n.at n=10A000293
- Coordination sequence T4 for Zeolite Code MOR.at n=36A008185
- Coordination sequence T3 for Zeolite Code SGT.at n=35A008231
- Coordination sequence T1 for Zeolite Code VFI.at n=43A008245
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (F(2), F(3), ...), t = (odd natural numbers).at n=17A024592
- n written in fractional base 5/3.at n=22A024633
- a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n-k+1), where k = [ n/2 ], s = (F(2), F(3), F(4), ...), t = (odd natural numbers).at n=16A025106
- Otto Haxel's guess for magic numbers of nuclear shells.at n=21A033547
- Number of partitions of n into parts 4k and 4k+1 with at least one part of each type.at n=52A035621
- Maximal base 5 run length is 4.at n=34A037983
- (s(n)+7)/10, where s(n)=n-th base 10 palindrome that starts with 3.at n=34A043082
- Numbers having four 4's in base 5.at n=18A043368
- Numbers having four 2's in base 6.at n=14A043380
- Numbers n such that string 2,2 occurs in the base 10 representation of n but not of n-1.at n=31A044354
- Numbers n such that string 2,2 occurs in the base 10 representation of n but not of n+1.at n=31A044735
- Numbers whose base-4 representation contains exactly three 0's and two 3's.at n=33A045078
- Generalized Pellian with second term of 10.at n=5A048879
- Numbers n such that 227*2^n-1 is prime.at n=15A050865
- a(n) = 2*(n^2 - n + 1).at n=40A051890
- Triangle T(n, k) giving coefficients in expansion of n! * Sum_{i=0..n} binomial(x - n, i) in powers of x.at n=38A054649