15837
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 21120
- Proper Divisor Sum (Aliquot Sum)
- 5283
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10556
- Möbius Function
- 1
- Radical
- 15837
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 146
- 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 whose base-4 representation contains exactly three 1's and four 3's.at n=29A045128
- Discriminants of real quadratic fields with class number 1 and related continued fraction period length of 20.at n=27A050969
- Number of n X n binary arrays symmetric about both diagonal and antidiagonal with all ones connected only in a 1000-1000-1111-1000 pattern in any orientation.at n=17A147127
- Expansion of g.f.: (1 + x^2 - x^3)/(1 - x - x^2 + x^3 - x^5).at n=27A147604
- Numbers k such that k^6 - 2 and k^6 + 2 are both primes.at n=24A154938
- a(n) is the number of terms in the expansion of (x-y)*(x^4-y^4)*(x^9-y^9)*...*(x^(n^2)-y^(n^2)).at n=35A225549
- Number of compositions of n with exactly 6 transitions between different parts.at n=7A244718
- Number of nX3 0..1 arrays with every element unequal to 0, 1, 2, 3 or 6 king-move adjacent elements, with upper left element zero.at n=8A304467
- Nested base shift convergence sequence (NBSC): gives the constant term of the convergence of a number n into a base sequence conversion nest: a(n) = ...FromDigits(IntegerDigits(FromDigits(IntegerDigits(n,2),3),4),5)..., until the result does not change for more iterations.at n=26A326653
- G.f. A(x) satisfies: 0 = Sum_{n=-oo..+oo} x^(n*(n+1)/2) * (x^n - 2*A(x))^(n+1).at n=7A355862
- Number of integer compositions of n whose leaders of weakly increasing runs are distinct.at n=19A374632