15084
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 18
- Divisor Sum
- 38220
- Proper Divisor Sum (Aliquot Sum)
- 23136
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5016
- Möbius Function
- 0
- Radical
- 2514
- Omega Function (Ω)
- 5
- 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
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 115
- 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
- yes
- Odd
- no
Appears in sequences
- Number of bracelets (turnover necklaces) of n beads of 4 colors.at n=8A032275
- Number of ways to color vertices of a 9-gon using <= n colors, allowing rotations and reflections.at n=4A060561
- Triangle T(n,k) read by rows, giving number of bracelets (turnover necklaces) with n beads of k colors (n >= 1, 1 <= k <= n).at n=39A081720
- Triangle, read by rows, of coefficients in powers of e.g.f. for A100065 such that, for each row n>=0, Sum_{k=0..n} T(n,k)/k! = [exp(n)] (integer floor of e^n).at n=26A100064
- Numbers n such that 8*10^n + 7*R_n + 2 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=16A103091
- Numbers with no 1's in base 3 & 4 expansions.at n=44A117496
- Consider necklaces with n beads, each black or white, where the n segments of cord between the beads are each colored red or green; a(n) is the number of different necklaces under the action of the dihedral group D_{2n}.at n=9A161221
- 3rd term of continued fraction for sqrt(2)^sqrt(2)^...^sqrt(2) with n sqrt(2)'s.at n=24A198094
- Volume of the Johnson square pyramid (rounded down) with all the edge lengths equal to n.at n=39A229063
- Numbers n such that n*2^1279 - 1 is prime.at n=41A265502
- Triangle T(n,k) read by rows: coefficients of polynomials P_n(t) defined in Formula section.at n=13A286800
- Total number of 1's in all (binary) max-heaps on n elements from the set {0,1}.at n=17A309052
- Numbers k such that k and k+1 are both terms in A377209.at n=10A377271
- Number of polyforms with n cells on the faces of a pentakis dodecahedron up to rotation and reflection.at n=13A383494
- A005117(k) - 1 where k is the least k such that A389412(k) = n.at n=24A389879