15011
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 15912
- Proper Divisor Sum (Aliquot Sum)
- 901
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 14112
- Möbius Function
- 1
- Radical
- 15011
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 177
- 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
- Convolution of natural numbers n >= 1 with Lucas numbers L(k) (A000032) for k >= 3.at n=13A033813
- Numbers n such that RevBinary(RevDecimal(n))=RevDecimal(RevBinary(n)), where RevDecimal(n) is the decimal reversal of n (A004086) and RevBinary(n) is the binary reversal of n (A030101).at n=46A081433
- Triangle read by rows: T(n,k) is the number of stacks of n pancakes requiring k = 0, ..., A058986(n) flips to sort.at n=42A092113
- Semiprimes (A001358) whose digit reversal is a pentagonal number (A000326).at n=22A115708
- a(n) = floor(n*exp(csc(n))).at n=18A134901
- Expansion of 1/(x^k*(1-x-2*x^(k+1))) for k=5.at n=27A143448
- Coefficient triangle sequence of a polynomial recursion: p(x,n)=(x + 1)*(p(x, n - 1) + 3^(n - 2)*(x + x^Floor[n/2] + x^(n - 2))); Row sums are 2*3^n.at n=57A153311
- Number of planar triangular n X n X n nonnegative integer grids with every similarly oriented 4 X 4 X 4 subtriangle summing to 5.at n=8A154049
- a(n) = a(n-1) + a(n-2) - a(n-4) starting a(0)=0, a(1)=1, a(2)=a(3)=3.at n=31A168637
- Number of partitions of n containing at least one part m-9 if m is the largest part.at n=33A212549
- Ascending list of base-60 happy numbers written in base 10.at n=40A318235
- Number of ways to choose a sequence of integer partitions, one of each part of an integer partition of n into odd parts.at n=18A358825
- Number of integer partitions of n where the parts do not have the same median as the distinct parts.at n=36A360244
- Number of partitions of n with exactly five part sizes.at n=25A365631