15799
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 31
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 18848
- Proper Divisor Sum (Aliquot Sum)
- 3049
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12960
- Möbius Function
- -1
- Radical
- 15799
- 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
- no
- Odd
- yes
Appears in sequences
- Strong pseudoprimes to base 48.at n=18A020274
- Numerators of continued fraction convergents to sqrt(543).at n=6A042038
- Numbers k such that 63*2^k-1 is prime.at n=36A050557
- Triangle of numbers arising in recursive computation of A002212.at n=40A073149
- Products of three distinct primes of the form 6*k + 1.at n=36A154729
- Number of strings of numbers x(i=1..n) in 0..5 with sum i^4*x(i) equal to n^4*5.at n=11A184344
- Partial sums of A256970.at n=34A256971
- Expansion of Product_{k>=1} 1/(1-x^k)^(k+(-1)^k).at n=18A258386
- a(n) = 2*A090495(n) - 1.at n=27A274297
- p-INVERT of (0,1,0,1,0,1,...), where p(S) = 1 - S^3 - S^4.at n=19A291223
- Number of n X n 0..1 arrays with every element equal to 2 or 3 king-move adjacent elements, with upper left element zero.at n=9A297808
- Number of partitions of 2n into distinct parts whose bitwise XOR equals 0.at n=50A307506
- Numbers k such that k and k+1 are both divisible by the total binary weight of their divisors (A093653).at n=7A338514