15546
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
- 31104
- Proper Divisor Sum (Aliquot Sum)
- 15558
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 5180
- Möbius Function
- -1
- Radical
- 15546
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 40
- 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
- Number of n-bead necklaces with exactly three different colored beads.at n=10A056283
- Number of primitive (period n) n-bead necklaces with exactly three different colored beads.at n=10A056288
- Expansion of (1-x)/(1+x-2*x^2+2*x^3).at n=12A078040
- Partial sums of A005557.at n=8A115130
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (0, -1, 0), (0, 1, -1), (1, 1, 0), (1, 1, 1)}.at n=7A150984
- Position of [n, n, ..., n] (n n's) in Mathematica-ordered list of partitions of n^2.at n=6A238640
- Left inverse of A274647.at n=15A276342
- Number of 3-abelian equivalence classes of words of length n over a binary alphabet.at n=24A289657
- The number of fishy digraphs of order n (up to isomorphy).at n=5A352637