15134
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 27648
- Proper Divisor Sum (Aliquot Sum)
- 12514
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6072
- Möbius Function
- 1
- Radical
- 15134
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 133
- 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
- a(n) = n*(n+4)*(n+5)/6.at n=42A005586
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Fibonacci numbers), t = A001950 (upper Wythoff sequence).at n=24A025085
- G.f. satisfies A(x) = 1 + x*cycle_index(G,A(x)) where G = cyclic group of order 2 generated by (1,2)(3,4).at n=8A036723
- Sum_{i=0..n} (C(n,i) mod 2)*Fibonacci(2i+3) = FL(n+3)Product(L(2^i)^bit(n,i),i=0..).at n=9A050612
- Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=3, r=3, I={-1,0,2}.at n=20A079987
- Number of base 14 circular n-digit numbers with adjacent digits differing by 3 or less.at n=5A125324
- a(n) = (n-2)*(n+3)*(n+2)/6.at n=44A129936
- Number of 1-sided strip polyedges with n cells.at n=10A151538
- Numbers k such that k, k + 1 and k + 2 are 3 consecutive Harshad numbers.at n=39A154701
- Sums of two successive primes s such that s+-3 are primes.at n=30A179485
- a(n) = Sum_{i+j+k=n, i,j,k >= 1} tau(i)*tau(j)*tau(k), where tau() = A000005().at n=32A191829
- a(n) = Sum_{k=0..n} ceiling(phi^k), where phi is the golden ratio (A001622).at n=18A279100
- Hosoya triangle of Morgan Voyce type, read by rows.at n=39A284131
- Hosoya triangle of Morgan Voyce type, read by rows.at n=41A284131
- Number of even parts in the partitions of n into 10 parts.at n=40A309662
- Number of scalene triangles whose vertices are the vertices of a regular n-gon.at n=44A330197
- Number of partitions of n such that 5*(least part) + 1 = greatest part.at n=56A363077
- Number of growing self-avoiding walks with displacement n on a half-infinite strip of height 6 with a trapped endpoint.at n=2A374304