15393
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 23488
- Proper Divisor Sum (Aliquot Sum)
- 8095
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8784
- Möbius Function
- -1
- Radical
- 15393
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 58
- 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
- no
- Odd
- yes
Appears in sequences
- Expansion of 1/(1-x^4-x^5-x^6-x^7-x^8-x^9-x^10-x^11).at n=37A017833
- Numbers k such that 4*5^k - 1 is prime.at n=15A046865
- a(n) = floor(surface area of a sphere with radius n).at n=34A066644
- Floor (e^(n / log(n))).at n=32A096181
- Number of compositions of n where the smallest part is greater than the number of parts.at n=48A098132
- Integers k such that 10^k + 33 is prime.at n=22A107084
- a(n) = (p(n)*p(n+1)-p(n+2))/2, where p(n) is the n-th odd prime.at n=38A152527
- T(n,k) is the number of 0..k arrays x(0..n+1) of n+2 elements without any interior element greater than both neighbors.at n=47A200886
- Number of 0..n arrays x(0..4) of 5 elements without any interior element greater than both neighbors.at n=7A200888
- Expansion of (1-x^2-x^3-x^4+x^5)/((1-x)^3*(1-x-x^2)^2*(1-2*x-x^2+x^3)).at n=8A205492
- Total sum of odd parts in the last section of the set of partitions of n.at n=28A206435
- Triangle of coefficients of polynomials u(n,x) jointly generated with A209774; see the Formula section.at n=53A209773
- Number of length n+3 0..2 arrays with at most one downstep in every n consecutive neighbor pairs.at n=11A255110
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 133", based on the 5-celled von Neumann neighborhood.at n=28A270234
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 213", based on the 5-celled von Neumann neighborhood.at n=27A270903
- a(n) = (n-1)! + 1 mod n^3.at n=25A301317
- The number of hanging vertically stable self-avoiding walks of length n on a 2D square lattice where both the nodes and connecting rods have mass.at n=16A335780
- Number of non-strict integer partitions of n with at least one part of odd multiplicity that is not the first or last.at n=36A349796
- Number of ways to write n as an ordered sum of seven positive Fibonacci numbers (with a single type of 1).at n=32A357694
- Triangle read by rows: T(n,k) is the number of bicolored cubic graphs on 2n unlabeled vertices with k vertices of the first color, n >= 0, 0 <= k <= 2*n.at n=40A361361