3188
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
- 6
- Divisor Sum
- 5586
- Proper Divisor Sum (Aliquot Sum)
- 2398
- 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
- 1592
- Möbius Function
- 0
- Radical
- 1594
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 123
- 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
- Expansion of a modular function.at n=15A006707
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite BOG = Boggsite Na4Ca7[Al18Si78O192].74H2O starting with a T2 atom.at n=11A019082
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite SGT = Sigma-2 [Si64O128].4R starting with a T2 atom.at n=11A019237
- Numbers k such that Fibonacci(k) == -3 (mod k).at n=42A023164
- Convolution of Thue-Morse sequence A001285 with primes.at n=33A029888
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 28.at n=31A031526
- Number of partitions of n into parts not of the form 21k, 21k+2 or 21k-2. Also number of partitions with 1 part of size 1 and differences between parts at distance 9 are greater than 1.at n=32A035980
- Number of partitions of n such that cn(0,5) = cn(2,5) < cn(3,5) = cn(4,5) < cn(1,5).at n=54A036858
- Positive numbers having the same set of digits in base 6 and base 9.at n=18A037436
- Numbers k such that the string 3,2 occurs in the base 9 representation of k but not of k-1.at n=44A044280
- Numbers n such that string 8,8 occurs in the base 10 representation of n but not of n-1.at n=31A044420
- Numbers k such that string 8,8 occurs in the base 10 representation of k but not of k+1.at n=31A044801
- a(0)=1, a(n) = 2*Fibonacci(n+4) - 6.at n=13A063758
- Unitary untouchable numbers: us(x) = n has no solution where us(x) (A063919) is the sum of the proper unitary divisors of x.at n=20A063948
- Number of even cycles in range [A014137(n-1)..A014138(n-1)] of permutation A057505/A057506, with two fixed-points of A057164.at n=15A081160
- Number of even cycles in range [A014137(2n)..A014138(2n)] of permutation A057505/A057506, with two fixed-points of A057164.at n=7A081161
- a(1)=0; for i>=1, a(i+1)=position of first occurrence of a(i) in decimal expansion of e.at n=6A098266
- Number of partitions of n into distinct parts with an odd rank.at n=54A117193
- Numbers k such that k^10 + 9 is prime.at n=32A125264
- Triangle read by rows: T(n,k) is the number of binary trees (i.e., a rooted tree where each vertex has either 0, 1, or 2 children; and, when only one child is present, it is either a right child or a left child) with n edges and k pairs of adjacent vertices of outdegree 2.at n=14A126219