15157
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 15840
- Proper Divisor Sum (Aliquot Sum)
- 683
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 14476
- Möbius Function
- 1
- Radical
- 15157
- 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
- 40
- 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
- Revert transform of 2*x*(1 - x + x^2 - x^3 - x^5)-x/(1+x).at n=11A049178
- Number of zero-sum -n..n arrays of 4 elements with first through third differences also in -n..n.at n=26A202512
- Number of triples (w,x,y) with all terms in {0,...,n} and w >= floor((x+y)/3).at n=27A212972
- Number of partitions of n containing the number of distinct parts as a part.at n=40A239945
- Number of active (ON, black) cells at stage 2^n-1 of the two-dimensional cellular automaton defined by "Rule 51", based on the 5-celled von Neumann neighborhood.at n=6A270019
- a(n) is the smallest composite squarefree number k such that (p+n) | (k+1) for all primes dividing k.at n=29A274446
- First 5-digit number to appear n times in the decimal expansion of Pi.at n=13A277171
- First 5-digit number to appear n times in the decimal expansion of Pi.at n=15A277171
- First 5-digit number to appear n times in the decimal expansion of Pi.at n=18A277171
- First 5-digit number to appear n times in the decimal expansion of Pi.at n=19A277171
- MM-numbers of capturing, non-nesting multiset partitions (with empty parts allowed).at n=23A326260
- Number of compositions (ordered partitions) of n into distinct parts where no part is a multiple of 3.at n=37A332309
- Expansion of (x^2*(3*x - 1))/((x - 1)^4*(x + 1)).at n=46A391994