3138
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 6288
- Proper Divisor Sum (Aliquot Sum)
- 3150
- 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
- 1044
- Möbius Function
- -1
- Radical
- 3138
- 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
- 35
- Smith Number
- yes
- 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
- Number of partitions with no even part repeated; partitions of n in which no parts are multiples of 4.at n=32A001935
- Number of points on surface of octahedron; also coordination sequence for cubic lattice: a(0) = 1; for n > 0, a(n) = 4n^2 + 2.at n=28A005899
- Coordination sequence T2 for Zeolite Code BPH.at n=43A008056
- Coordination sequence T6 for Zeolite Code MTT.at n=35A008194
- Coordination sequence for C_3 lattice: a(n) = 16*n^2 + 2 (n>0), a(0)=1.at n=14A010006
- a(n) = floor(n*(n - 1)*(n - 2)/31).at n=47A011913
- a(n) = a(n-1) + a(n-2) + 1, with a(0)=3, a(1)=10.at n=13A022409
- Numbers k such that Fibonacci(k) == -8 (mod k).at n=34A023166
- 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 56.at n=0A031554
- Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 56.at n=1A031734
- Concatenation of n and n+7.at n=30A032612
- Number of partitions of n into parts not of the form 25k, 25k+4 or 25k-4. Also number of partitions with at most 3 parts of size 1 and differences between parts at distance 11 are greater than 1.at n=29A036003
- Digit sum of 'even' number equals digit sum of 'sum' and 'juxtaposition' of its prime factors (counted with multiplicity).at n=32A036926
- a(n)=(s(n)+2)/8, where s(n)=n-th base 8 palindrome that starts with 6 (in base 8), written in decimal digits.at n=26A043070
- Numbers k such that the string 6,6 occurs in the base 9 representation of k but not of k-1.at n=38A044311
- Numbers n such that string 3,8 occurs in the base 10 representation of n but not of n-1.at n=34A044370
- Numbers n such that string 6,6 occurs in the base 9 representation of n but not of n+1.at n=38A044692
- Numbers n such that string 3,8 occurs in the base 10 representation of n but not of n+1.at n=34A044751
- Numbers whose base-5 representation contains exactly three 0's and one 1.at n=26A045170
- Numbers whose base-5 representation contains exactly three 0's and one 2.at n=27A045185