3158
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 4740
- Proper Divisor Sum (Aliquot Sum)
- 1582
- 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
- 1578
- Möbius Function
- 1
- Radical
- 3158
- Omega Function (Ω)
- 2
- 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
- yes
- 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
- Numbers that are the sum of 3 positive 5th powers.at n=21A003348
- "Magic" integers: a(n+1) is the smallest integer m such that there is no overlap between the sets {m, m-a(i), m+a(i): 1 <= i <= n} and {a(i), a(i)-a(j), a(i)+a(j): 1 <= j < i <= n}.at n=33A004210
- a(n) = n*(11*n^2 - 5)/6.at n=12A004467
- Numbers that are the sum of at most 3 positive 5th powers.at n=39A004843
- Coordination sequence T4 for Zeolite Code AFO.at n=37A008018
- Coordination sequence T7 for Zeolite Code NES.at n=36A008211
- Coordination sequence T2 for Zeolite Code -CHI.at n=36A009847
- Twelve iterations of Reverse and Add are needed to reach a palindrome.at n=12A015993
- a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ...+ a(n-1)*a(1) for n >= 5, starting 1,0,1,1.at n=12A025273
- Molien series for complete weight enumerator of self-dual code over GF(5) containing all-1's vector.at n=12A028345
- Least term in period of continued fraction for sqrt(n) is 5.at n=16A031429
- 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=3A031554
- Numbers k such that A102489(k) is divisible by k.at n=15A032563
- Denominators of continued fraction convergents to sqrt(31).at n=9A041051
- Numbers k such that the string 8,8 occurs in the base 9 representation of k but not of k-1.at n=38A044331
- Numbers n such that string 5,8 occurs in the base 10 representation of n but not of n-1.at n=34A044390
- Numbers n such that string 8,8 occurs in the base 9 representation of n but not of n+1.at n=38A044712
- Numbers n such that string 5,8 occurs in the base 10 representation of n but not of n+1.at n=34A044771
- Numbers whose base-5 representation contains exactly two 0's and three 1's.at n=7A045168
- Coordination sequence T1 for Zeolite Code DON.at n=38A047953