15437
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 15840
- Proper Divisor Sum (Aliquot Sum)
- 403
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 15036
- Möbius Function
- 1
- Radical
- 15437
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 58
- 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
- no
- Odd
- yes
Appears in sequences
- Numbers that are the sum of 8 positive 7th powers.at n=43A003375
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (odd natural numbers), t = (primes).at n=28A024603
- a(n) = 2^n + n*3^n.at n=7A086090
- Number of partitions of 2n in which odd parts and multiples of 3 and 5 occur with even multiplicities. There is no restriction on the other even parts.at n=26A102346
- Number of n X n binary arrays symmetric under 90 degree rotation with all ones connected only in a 1000-1111-0100 pattern in any orientation.at n=13A146411
- Smallest m such that 2^m begins with a 1 and n 0's.at n=4A152561
- a(n) = n*(17*n - 13)/2.at n=43A180232
- Number of 3 X n 0..1 arrays with antidiagonals unimodal and rows and diagonals nondecreasing.at n=42A224039
- Number of partitions of n not containing the number of distinct parts as a part.at n=38A239946
- Number of length 3 1..(n+1) arrays with every leading partial sum divisible by 2, 3 or 5.at n=32A254830
- Number T(n,k) of permutations p of [n] with no fixed points where the maximal displacement of an element equals k; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=59A259784
- Number of unlabeled forests on n nodes that have exactly two nonempty components.at n=16A274937
- Expansion of Product_{k>=1} 1/(1 + x^k)^(k*(5*k-3)/2).at n=13A295122
- Number of permutations of [n] with no fixed points where the maximal displacement of an element equals four.at n=6A321050
- Number of compositions of n with the same runs-resistance as cuts-resistance.at n=18A329864
- a(n) = floor(2^n/(-1 + cot(1/n))).at n=17A332431
- Number of self-avoiding closed paths in the 4 X n grid graph which pass through all vertices on four (left, right, upper, lower) sides of the graph.at n=8A333760
- Semiprimes k such that k+2 and k+6 are primes and k+4 and k+8 are all semiprimes.at n=9A392186