15141
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 23712
- Proper Divisor Sum (Aliquot Sum)
- 8571
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8568
- Möbius Function
- 0
- Radical
- 2163
- Omega Function (Ω)
- 4
- 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
- 133
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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 k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 82.at n=26A031580
- Number of partitions satisfying cn(2,5) + cn(3,5) < cn(1,5) + cn(4,5).at n=37A039893
- Number of n-celled polyominoes without holes, symmetric about axis 2.at n=34A056880
- Decimal Goedelization of antitheorems from propositional calculus, in Richard C. Schroeppel's metatheory of A101273.at n=13A100200
- Indices of primes in sequence defined by A(0) = 61, A(n) = 10*A(n-1) + 81 for n > 0.at n=23A101541
- Triangle read by rows: T(n,0) = T(n,n) = 1 for n >= 0, T(n,k) = ((n - 1)! + 1)*binomial(n, k) for 1 <= k <= n - 1, n >= 2.at n=30A168621
- Triangle read by rows: T(n,0) = T(n,n) = 1 for n >= 0, T(n,k) = ((n - 1)! + 1)*binomial(n, k) for 1 <= k <= n - 1, n >= 2.at n=33A168621
- Positions of records in A096303.at n=14A229743
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 113", based on the 5-celled von Neumann neighborhood.at n=27A270179
- Records in A171797 starting from a(1).at n=29A305396
- Inverse Moebius transform of the sequence (n*A032173(n+2): n >= 1).at n=11A322913
- Number of n-dimensional representations of the group SU(3).at n=48A346159
- G.f. satisfies A(x) = (1 + x*A(x)/(1 - x*A(x))^3)^3.at n=5A365136
- G.f. A(x) satisfies A(x) = (1 + x)^3 * C(x*A(x)), where C(x) is the g.f. of A000108.at n=6A381860