3888
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 30
- Divisor Sum
- 11284
- Proper Divisor Sum (Aliquot Sum)
- 7396
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 1296
- Möbius Function
- 0
- Radical
- 6
- Omega Function (Ω)
- 9
- 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
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 100
- 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
- yes
- Achilles Number
- yes
- Perfect Power
- no
- Smooth Number
- yes
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Appears in sequences
- Order of the group SL(2,Z_n).at n=17A000056
- Generalized class numbers c_(n,1).at n=34A000233
- Number of invertible 2 X 2 matrices mod n.at n=8A000252
- a(n) is smallest number > a(n-1) of form a(i)*a(j), i < j < n.at n=37A000423
- A Fielder sequence.at n=12A001645
- Numbers k such that 15*2^k + 1 is prime.at n=25A002258
- Smallest number such that n-th iterate of Chowla function is 0.at n=19A002954
- Smallest number requiring n chisel strokes for its representation in Roman numerals.at n=33A002964
- 3-smooth numbers: numbers of the form 2^i*3^j with i, j >= 0.at n=54A003586
- (2^(2^n))*(3^(3^n - 2^n)).at n=2A007155
- Number of distinct perforation patterns for deriving (v,b) = (n+4,n) punctured convolutional codes from (2,1).at n=5A007225
- Smallest k such that phi(x) = k has exactly n solutions, n>=2.at n=46A007374
- Numbers k such that phi(k) divides k.at n=47A007694
- Coordination sequence T1 for Zeolite Code VFI.at n=48A008245
- a(n) = Product_{i=0..6} floor((n+i)/7).at n=23A009641
- a(n) = Product_{i=0..8} floor((n+i)/9).at n=23A009714
- Smallest k such that phi(x) = k has exactly n solutions, n>=0 with Carmichael conjecture.at n=48A014573
- n is equal to the number of 1's in all numbers <= n written in base 6.at n=10A014890
- n is equal to the number of 2's in all numbers <= n written in base 6.at n=6A014891
- Coordination sequence T8 for Zeolite Code TER.at n=42A016440