15798
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 30
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 31608
- Proper Divisor Sum (Aliquot Sum)
- 15810
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 5264
- Möbius Function
- -1
- Radical
- 15798
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 102
- 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
- Numbers having four 6's in base 8.at n=3A043448
- Coefficient of q^2 in nu(n), where nu(0)=1, nu(1)=b and, for n>=2, nu(n)=b*nu(n-1)+lambda*(1+q+q^2+...+q^(n-2))*nu(n-2) with (b,lambda)=(1,3).at n=10A074356
- Numbers k such that (k!-9)/9 is prime.at n=20A139204
- Number of arrays of 2n nondecreasing integers in -6..6 with sum zero and equal numbers greater than zero and less than zero.at n=5A203289
- T(n,k)=Number of arrays of 2n nondecreasing integers in -k..k with sum zero and equal numbers greater than zero and less than zero.at n=60A203291
- Number of arrays of 12 nondecreasing integers in -n..n with sum zero and equal numbers greater than zero and less than zero.at n=5A203296
- Total number of parts in all partitions of n plus the sum of largest parts of all partitions of n.at n=22A211978
- Number of nX1 arrays of the minimum or maximum value of corresponding elements and their horizontal and vertical neighbors in a random 0..3 nX1 array.at n=6A220106
- T(n,k)=Number of nXk arrays of the minimum or maximum value of corresponding elements and their horizontal and vertical neighbors in a random 0..3 nXk array.at n=21A220109
- T(n,k)=Number of nXk arrays of the minimum or maximum value of corresponding elements and their horizontal and vertical neighbors in a random 0..3 nXk array.at n=27A220109
- a(n) = number of steps to reach 0 when starting from k = n^3 and repeatedly applying the map that replaces k with k - A055401(k), where A055401(k) = the number of positive cubes needed to sum to k using the greedy algorithm.at n=51A261227
- Number of partitions of n with up to nine distinct kinds of 1.at n=18A320696
- Consecutive internal states of the linear congruential pseudo-random number generator (171*s + 11213) mod 53125 when started at 1.at n=14A385039
- Start the sequence S with a(1) = 1008973 and extend S with a(n)/2 when a(n) is even, otherwise with a(n) + the smallest prime not yet added.at n=14A388141