10158
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 20328
- Proper Divisor Sum (Aliquot Sum)
- 10170
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 3384
- Möbius Function
- -1
- Radical
- 10158
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 179
- Smith Number
- no
- 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
- Cluster series for bond percolation problem on diamond.at n=8A003208
- Molien series for A_9.at n=38A008632
- a(1)=2; for n>1, a(n)^2 is next smallest nontrivial square containing a(n-1)^2 as a substring.at n=4A050631
- a(1)=3; for n>1, a(n)^2 is next smallest nontrivial square containing a(n-1)^2 as a substring.at n=4A050633
- Least number k such that between k! and (k+1)! there are n powers of ten.at n=4A084420
- Sums of 3 consecutive semiprimes.at n=38A173968
- Sums of three consecutive numbers each of which is the product of two distinct primes and each of which has no exponent greater than one for either of its two prime factors.at n=36A173969
- Number of strictly increasing arrangements of 4 numbers in -(n+2)..(n+2) with sum zero.at n=33A188182
- Triangle of coefficients of polynomials u(n,x) jointly generated with A210748; see the Formula section.at n=39A210747
- Number of partitions p of n such that the multiplicity of the median of p is a part of p.at n=39A240492
- Number of length n inversion sequences avoiding the patterns 000, 010, 110, and 120.at n=10A279551
- Numbers k such that Lucas(k) + prime(k) is a prime.at n=7A288794
- Smallest number k such that exactly half the numbers in [1..k] are prime(n)-smooth.at n=42A290154
- Number of 3-uniform hypergraphs on n labeled vertices where no two edges have exactly one vertex in common.at n=8A323297
- a(1) = 1; a(n) = Sum_{d|n, d < n} d * a(d)^(n/d).at n=27A348661
- a(n) is the first positive number that has exactly n anagrams which have 3 prime divisors, counted by multiplicity, or 0 if there is no such number.at n=20A369184
- a(n) = the smallest positive integer that produces a product that contains the digit 2 when multiplied by 2 at most n times, and where a further multiplication by 2 produces a number that does not contain the digit 2. Set a(n) = -1 if no such number exists.at n=11A381183