3836
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 7728
- Proper Divisor Sum (Aliquot Sum)
- 3892
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 1632
- Möbius Function
- 0
- Radical
- 1918
- Omega Function (Ω)
- 4
- 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
- 131
- 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
- Kendall-Mann numbers: the most common number of inversions in a permutation on n letters is floor(n*(n-1)/4); a(n) is the number of permutations with this many inversions.at n=7A000140
- Expansion of (Product_{j>=1} (1-(-x)^j) - 1)^8 in powers of x.at n=22A001486
- Coordination sequence T3 for Zeolite Code BOG.at n=44A008051
- Coordination sequence T2 for Zeolite Code EPI.at n=39A008091
- Triangle of Mahonian numbers T(n,k): coefficients in expansion of Product_{i=0..n-1} (1 + x + ... + x^i), where k ranges from 0 to A000217(n-1). Also enumerates permutations by their major index.at n=77A008302
- Define the sequence S(a(0),a(1)) by a(n+2) is the least integer such that a(n+2)/a(n+1) > a(n+1)/a(n) for n >= 0. This is S(6,30).at n=4A022023
- Numbers having period-1 7-digitized sequences.at n=23A031201
- Used by Polya in calculating A000598.at n=14A036676
- Coordination sequence T13 for Zeolite Code STT.at n=41A038420
- Coordination sequence T15 for Zeolite Code STT.at n=41A038427
- Largest coefficient in expansion of Product_{i=1..n} (1-q^1+q^2-...+(-q)^i).at n=7A039909
- Numbers whose base-4 representation contains exactly one 0 and four 3's.at n=29A045070
- Numbers whose base-4 representation contains no 1's and exactly four 3's.at n=34A045113
- Numbers whose base-4 representation contains exactly one 2 and four 3's.at n=34A045142
- Coefficients of a special case of Poisson-Charlier polynomials.at n=39A046716
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the smallest integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = a(3) = 1.at n=37A050024
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2, and a(3) = 1.at n=37A050040
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 3, and a(3) = 1.at n=37A050056
- Numbers k such that 63*2^k-1 is prime.at n=29A050557
- Numbers k such that 75*2^k-1 is prime.at n=33A050563