13158
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 30888
- Proper Divisor Sum (Aliquot Sum)
- 17730
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4032
- Möbius Function
- 0
- Radical
- 4386
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 138
- 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
- Otto Haxel's guess for magic numbers of nuclear shells.at n=34A033547
- Multiplicity of highest weight (or singular) vectors associated with character chi_62 of Monster module.at n=37A034450
- (Terms in A029613)/2.at n=35A051435
- Composite numbers k such that phi(k + d(k)) = phi(k) + d(k), where phi() = A000010(), d() = A000005().at n=19A063702
- Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,31.at n=0A064252
- Number of compositions (ordered partitions) of n whereby at most 1 increase is allowed and this increase must be by 1.at n=23A090752
- a(0) = 1; a(n+1) = Sum_{k=0..n} a(k)*A001147(n-k), where A001147 = double factorial numbers.at n=7A112934
- Table T(n,k), n >= 0 and k >= 0, read by antidiagonals, related to A111146.at n=52A113143
- a(n)=sqrt(A127856(n)).at n=8A127857
- a(n) = 144*n^2 - 127*n + 28.at n=9A156719
- If 0 <= n <= 3 then a(n) = n(n+1)(n+2)/3, if n >= 4 then a(n) = n(n^2+5)/3.at n=34A162626
- Number of 6's in the last section of the set of partitions of n.at n=47A206556
- Decimal value of the bitmap of active segments in 7-segment display of the number n, variant 2 ("abcdefg" scheme: bits represent segments in clockwise order).at n=44A234692
- Nonequivalent ways to place two different markers (e.g., a pair of Go stones, black and white) on an n X n grid.at n=17A242709
- Numbers whose sum of anti-divisors is equal to the sum of the divisors of their arithmetic derivative.at n=19A249912
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 86", based on the 5-celled von Neumann neighborhood.at n=40A270127
- Numbers k such that there are exactly 5 numbers j for which binomial(k, floor(k/2)) / binomial(k,j) is an integer, i.e., A080383(k) = 5.at n=40A327430
- Triangle read by rows: T(n,k) is the number of permutations of k elements from [1..n] where adjacent values cannot be consecutive modulo n.at n=51A338838
- Square table, read by antidiagonals: the g.f. for row n is given recursively by (2*n-1)*x*R(n,x) = 1 + (2*n-3)*x - 1/R(n-1,x) for n >= 1 with the initial value R(0,x) = Sum_{k >= 0} A112934(k+1)*x^k.at n=27A355721
- Numbers N such that N + the sum of the cubes of its digits is again a third power.at n=15A362953