15935
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 19128
- Proper Divisor Sum (Aliquot Sum)
- 3193
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12744
- Möbius Function
- 1
- Radical
- 15935
- 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
- 97
- 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
- Number of ways to partition n elements into pie slices of different sizes of at least 2 allowing the pie to be turned over.at n=42A032230
- Number of partitions of n into parts not of form 4k+2, 24k, 24k+11 or 24k-11. Also number of partitions in which no odd part is repeated, with at most 5 parts of size less than or equal to 2 and where differences between parts at distance 5 are greater than 1 when the smallest part is odd and greater than 2 when the smallest part is even.at n=50A036034
- Numbers whose base-5 representation contains exactly three 0's and three 2's.at n=13A045187
- Number of n-bead necklace structures using a maximum of four different colored beads.at n=10A056292
- Number of primitive (period n) step cyclic shifted sequence structures using a maximum of four different symbols.at n=11A056441
- Euler transform of Euler totient function phi(n), cf. A000010.at n=21A061255
- Lucas 8-step numbers.at n=13A105754
- Numbers k such that 1 + (x + x^3 + x^5 + x^7 + ... + x^(2*k+1)) is irreducible over GF(2).at n=30A107220
- Number of n X 3 0..1 arrays with each 1 adjacent to 3 or 4 king-move neighboring 1's.at n=10A296110
- Array read by antidiagonals: T(n,k) is the number of color patterns (set partitions) in an oriented cycle of length n using k or fewer colors (subsets).at n=101A320747
- Positions of records in A365367.at n=4A365370